Further Improvement in Approximating the Maximum Duo-Preservation String Mapping Problem

This publication has 15 references indexed in Scilit:

• Mathematical programming strategies for solving the minimum common string partition problem
  European Journal of Operational Research, 2015
• Solving the maximum duo-preservation string mapping problem with linear programming
  Theoretical Computer Science, 2014
• Improved Approximation for the Maximum Duo-Preservation String Mapping Problem
  Lecture Notes in Computer Science, 2014
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
  2013
• A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
  2013
• Solving the Minimum Common String Partition Problem with the Help of Ants
  Lecture Notes in Computer Science, 2013
• Minimum Common String Partition Parameterized
  2008
• The string edit distance matching problem with moves
  ACM Transactions on Algorithms, 2007
• Assignment of Orthologous Genes via Genome Rearrangement
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2005
• The Greedy Algorithm for the Minimum Common String Partition Problem
  Lecture Notes in Computer Science, 2004