Annals of Operations Research - Special issue on Tabu search
On the closest string and substring problems
Journal of the ACM (JACM)
Banishing Bias from Consensus Sequences
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Genetic Algorithm Approach for the Closest String Problem
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing
A parallel multistart algorithm for the closest string problem
Computers and Operations Research
On the Structure of Small Motif Recognition Instances
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A data-based coding of candidate strings in the closest string problem
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Consensus Optimizing Both Distance Sum and Radius
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
More efficient algorithms for closest string and substring problems
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
| Hi-index | 0.01 |
The closest string problem that arises in both computational biology and coding theory is to find a string minimizing the maximum Hamming distance from a given set of strings. This study proposes an efficient heuristic algorithm for this NP-hard problem. The key idea is to apply the Lagrangian relaxation technique to the problem formulated as a mixed-integer programming problem. This enables us to decompose the problem into trivial subproblems corresponding to each position of the strings. Furthermore, a feasible solution can be easily obtained from a solution of the relaxation. Based on this, a heuristic algorithm is constructed by combining a Lagrangian multiplier adjustment procedure and a tabu search. Computational experiments will show that the proposed algorithm can find good approximate solutions very fast.