A hybrid metaheuristic for Closest String Problem

The Closest String Problem (CSP) is an optimisation problem, which is to obtain a string with the minimum distance from a number of given strings. In this paper, a new metaheuristic algorithm is investigated for the problem, whose main feature is relatively high speed in obtaining good solutions, which is essential when the input size is large. The proposed algorithm is compared with four recent algorithms suggested for the problem, outperforming them in more than 98% of the cases. It is also remarkably faster than all of them, running within 1 s in most of the experimental cases.

[1]  Bin Ma,et al.  Finding similar regions in many strings , 1999, STOC '99.

[2]  Jens Stoye,et al.  Computation of Median Gene Clusters , 2008, RECOMB.

[3]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[4]  Ming Li,et al.  On the k-Closest Substring and k-Consensus Pattern Problems , 2004, CPM.

[5]  P Festa,et al.  On some optimization problems in molecular biology. , 2007, Mathematical biosciences.

[6]  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.

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

[8]  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.

[9]  Jens Gramm.  Closest Substring , 2008, Encyclopedia of Algorithms.

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

[11]  Sayyed R Mousavi,et al.  A Hybridization of Constructive Beam Search with Local Search for Far From Most Strings Problem , 2010 .

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

[13]  Ming Li,et al.  Some string problems in computational biology , 2000 .

[14]  Rolf Niedermeier,et al.  Exact Solutions for CLOSEST STRING and Related Problems , 2001, ISAAC.

[15]  A. Macario,et al.  Gene Probes for Bacteria , 1990 .

[16]  Kun-Mao Chao,et al.  Efficient Algorithms for Some Variants of the Farthest String Problem , 2006 .

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

[18]  Jing-Chao Chen,et al.  Iterative Rounding for the Closest String Problem , 2007, ArXiv.

[19]  Seyed Rasoul Mousavi,et al.  A Memetic Algorithm for closest string problem and farthest string problem , 2010, 2010 18th Iranian Conference on Electrical Engineering.

[20]  Jianer Chen,et al.  An improved lower bound on approximation algorithms for the Closest Substring problem , 2008, Inf. Process. Lett..

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

[22]  Panos M. Pardalos,et al.  MODELING AND SOLVING STRING SELECTION PROBLEMS , 2005 .

[23]  Jens Stoye,et al.  Swiftly Computing Center Strings , 2010, WABI.

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

[25]  Rolf Niedermeier,et al.  On Exact and Approximation Algorithms for Distinguishing Substring Selection , 2003, FCT.

[26]  Gary D. Stormo,et al.  Identification of consensus patterns in unaligned DNA sequences known to be functionally related , 1990, Comput. Appl. Biosci..

[27]  Sayyed Rasoul Mousavi,et al.  A GRASP algorithm for the Closest String Problem using a probability-based heuristic , 2012, Comput. Oper. Res..

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

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

[30]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[31]  Rolf Niedermeier,et al.  Closest Strings, Primer Design, and Motif Search , 2010 .

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

[33]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .