A heuristic algorithm based on Lagrangian relaxation for the closest string problem

The closest string problem that arises in both computational biology and coding theory is to find a string that minimizes 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 an 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. Numerical experiments will show the effectiveness of the proposed algorithm.

[1]  Panos M. Pardalos,et al.  Optimal Solutions for the Closest-String Problem via Integer Programming , 2004, INFORMS J. Comput..

[2]  Xuan Liu,et al.  Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem , 2005, ADMA.

[3]  Christina Boucher,et al.  On the Structure of Small Motif Recognition Instances , 2008, SPIRE.

[4]  Bryant A. Julstrom,et al.  A data-based coding of candidate strings in the closest string problem , 2009, GECCO '09.

[5]  P. Pardalos,et al.  Optimization techniques for string selection and comparison problems in genomics , 2005, IEEE Engineering in Medicine and Biology Magazine.

[6]  Simone Faro,et al.  Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem , 2009, SOFSEM.

[7]  Bin Ma,et al.  More Efficient Algorithms for Closest String and Substring Problems , 2008, SIAM J. Comput..

[8]  Xiaotie Deng,et al.  Center and Distinguisher for Strings with Unbounded Alphabet , 2002, J. Comb. Optim..

[9]  Giuseppe Lancia,et al.  Banishing Bias from Consensus Sequences , 1997, CPM.

[10]  Bin Ma,et al.  On the closest string and substring problems , 2002, JACM.

[11]  Xiaolan Liu,et al.  A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem , 2008, 2008 2nd International Conference on Bioinformatics and Biomedical Engineering.

[12]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[13]  Ami Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[14]  Gad M. Landau,et al.  Consensus Optimizing Both Distance Sum and Radius , 2009, SPIRE.

[15]  Lusheng Wang,et al.  Efficient Algorithms for the Closest String and Distinguishing String Selection Problems , 2009, FAW.

[16]  Holger Mauch,et al.  Genetic algorithm approach for the closest string problem , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[17]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[18]  Panos M. Pardalos,et al.  A parallel multistart algorithm for the closest string problem , 2008, Comput. Oper. Res..

[19]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..