An Integer Programming Formulation of the Minimum Common String Partition Problem

We consider the problem of finding a minimum common string partition (MCSP) of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology. In this paper, we map the MCSP problem into a graph applying a prior technique and using this graph, we develop an Integer Linear Programming (ILP) formulation for the problem. We implement the ILP formulation and compare the results with the state-of-the-art algorithms from the literature. The experimental results are found to be promising.

[1]  Dan He,et al.  A Novel Greedy Algorithm for the Minimum Common String Partition Problem , 2007, ISBRA.

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

[3]  Christian Komusiewicz,et al.  A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications , 2013, WABI.

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

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

[6]  Christian Komusiewicz,et al.  Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable , 2013, SODA.

[7]  Marek Chrobak,et al.  The Greedy Algorithm for the Minimum Common String Partition Problem , 2004, APPROX-RANDOM.

[8]  Jens Stoye,et al.  Algorithms in Bioinformatics , 2013, Lecture Notes in Computer Science.

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

[10]  Hong Zhu,et al.  Minimum common string partition revisited , 2010, J. Comb. Optim..

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

[12]  Avraham Goldstein,et al.  Minimum Common String Partition Problem: Hardness and Approximations , 2005 .

[13]  Guoyin Wang,et al.  Advances in Swarm Intelligence , 2011, Lecture Notes in Computer Science.

[14]  ProblemMarek Chrobak.  The Greedy Algorithm for the MinimumCommon String Partition , 2004 .

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

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

[17]  Mohammad Sohel Rahman,et al.  Solving the Minimum Common String Partition Problem with the Help of Ants , 2013, ICSI.

[18]  Jens Lagergren,et al.  Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings , 2008, WABI.

[19]  Krister M. Swenson,et al.  Approximating the true evolutionary distance between two genomes , 2008, JEAL.

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

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

[22]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

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

[24]  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).

[25]  Shi Ying,et al.  Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.

[26]  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).

[27]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

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

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

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

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

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

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

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

[35]  Oliver Eulenstein,et al.  Bioinformatics Research and Applications , 2008 .

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

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

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