A Meta Heuristic Solution for Closest String Problem Using Ant Colony System

Suppose Σ is the alphabet set and S is the set of strings with equal length over alphabet Σ. The closest string problem seeks for a string over Σ that minimizes the maximum hamming distance with other strings in S. The closest string problem is NP-complete. This problem has particular importance in computational biology and coding theory. In this paper we present an algorithm based on ant colony system. The proposed algorithm can solve closest string problem with reasonable time complexity. Experimental results have shown the correctness of algorithm. At the end, a comparison with one Meta heuristic algorithm is also given.

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

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

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

[4]  Joaquín Dopazo,et al.  Design of primers for PCR amplification of highly variable genomes , 1993, Comput. Appl. Biosci..

[5]  Lusheng Wang,et al.  Randomized Algorithms for Motif Detection , 2004, ISAAC.

[6]  Rolf Niedermeier,et al.  On The Parameterized Intractability Of Motif Search Problems* , 2002, Comb..

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

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

[9]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

[11]  Ying Wang,et al.  Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA , 2006, BMC Bioinformatics.

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

[13]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[14]  Todd Wareham,et al.  On the complexity of finding common approximate substrings , 2003, Theor. Comput. Sci..

[15]  Bin Ma,et al.  Genetic Design of Drugs Without Side-Effects , 2003, SIAM J. Comput..

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

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

[18]  Edward C. Holmes,et al.  Primer Master: a new program for the design and analysis of PCR primers , 1996, Comput. Appl. Biosci..

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

[20]  Piotr Berman,et al.  A Linear-Time Algorithm for the 1-Mismatch Problem , 1997, WADS.

[21]  Bin Ma,et al.  A Polynominal Time Approximation Scheme for the Closest Substring Problem , 2000, CPM.

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

[24]  Harvey J. Motulsky,et al.  Detecting outliers when fitting data with nonlinear regression – a new method based on robust nonlinear regression and the false discovery rate , 2006, BMC Bioinformatics.

[25]  Holger Mauch,et al.  Closest Substring Problem - Results from an Evolutionary Algorithm , 2004, ICONIP.

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

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

[28]  Dániel Marx,et al.  The closest substring problem with small distances , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[29]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[30]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[31]  K. Lucas,et al.  An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes , 1991, Comput. Appl. Biosci..

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

[33]  Andrew D. Smith,et al.  Complexity of Approximating Closest Substring Problems , 2003, FCT.