Solving the Minimum Common String Partition Problem with the Help of Ants

In this paper, we consider the problem of finding minimum common partition of two strings (MCSP). The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this. The preliminary experimental results are found to be promising.

[1]  Tao Jiang,et al.  Assignment of orthologous genes via genome rearrangement - eScholarship , 2005 .

[2]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[3]  Holger H. Hoos,et al.  Improving the Ant System: A Detailed Report on the MAX-MIN Ant System , 1996 .

[4]  Shyong Jian Shyu,et al.  Finding the longest common subsequence for multiple biological sequences by ant colony optimization , 2009, Comput. Oper. Res..

[5]  Petr Kolman,et al.  Minimum Common String Partition Problem: Hardness and Approximations , 2004, Electron. J. Comb..

[6]  Tao Jiang,et al.  Computing the Assignment of Orthologous Genes via Genome Rearrangement , 2005, APBC.

[7]  Christian Blum,et al.  Mathematical programming strategies for solving the minimum common string partition problem , 2014, Eur. J. Oper. Res..

[8]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[9]  Christian Blum,et al.  An ant colony optimization algorithm for DNA sequencing by hybridization , 2008, Comput. Oper. Res..

[10]  Palle Villesen,et al.  FaBox: an online toolbox for fasta sequences , 2007 .

[11]  Marek Chrobak,et al.  The greedy algorithm for the minimum common string partition problem , 2005, TALG.

[12]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[13]  S. M. Ferdous,et al.  An Ant Colony Optimization approach to solve the minimum string cover problem , 2012, 2012 International Conference on Informatics, Electronics & Vision (ICIEV).

[14]  W. Ewens,et al.  The chromosome inversion problem , 1982 .

[15]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[16]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[17]  Christian Blum.  Beam-ACO for the longest common subsequence problem , 2010, IEEE Congress on Evolutionary Computation.

[18]  Christian Blum,et al.  Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem , 2014, Hybrid Metaheuristics.

[19]  Hong Zhu,et al.  Minimum Common String Partition Revisited , 2010, FAW.

[20]  Mohammad Sohel Rahman,et al.  An Integer Programming Formulation of the Minimum Common String Partition Problem , 2015, PloS one.

[21]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[22]  Xin Chen,et al.  Assignment of orthologous genes via genome rearrangement , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[23]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[25]  Peter Damaschke,et al.  Minimum Common String Partition Parameterized , 2008, WABI.

[26]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[27]  P Stothard,et al.  The sequence manipulation suite: JavaScript programs for analyzing and formatting protein and DNA sequences. , 2000, BioTechniques.

[28]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .