Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable

The NP-hard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings such that both partitions use exactly the same substrings in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter k.

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

[2]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

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

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

[5]  Vineet Bafna,et al.  Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[6]  Petr Kolman,et al.  Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set , 2006, Electron. J. Comb..

[7]  Bin Fu,et al.  Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem , 2011, COCOA.

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

[9]  Dana Shapira,et al.  Edit distance with move operations , 2002, J. Discrete Algorithms.

[10]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[11]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

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

[13]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2002, SODA '02.

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