Journal of Combinatorial Optimization

, Volume 23, Issue 4, pp 519–527 | Cite as

Minimum common string partition revisited

  • Haitao Jiang
  • Binhai Zhu
  • Daming Zhu
  • Hong Zhu


Minimum Common String Partition (MCSP) has drawn much attention due to its application in genome rearrangement. In this paper, we investigate three variants of MCSP: MCSP c , which requires that there are at most c elements in the alphabet; d-MCSP, which requires the occurrence of each element to be bounded by d; and x-balanced MCSP, which requires the length of blocks being in range (n/kx,n/k+x), where n is the length of the input strings, k is the number of blocks in the optimal common partition and x is a constant integer. We show that MCSP c is NP-hard when c≥2. As for d-MCSP, we present an FPT algorithm which runs in O ((d!)2k ) time. As it is still unknown whether an FPT algorithm only parameterized on k exists for the general case of MCSP, we also devise an FPT algorithm for the special case x-balanced MCSP parameterized on both k and x.


Minimum common string partition Genomic distance Genome rearrangement NP-completeness FPT algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Chen X, Zheng J, Fu Z, Nan P, Zhong Y, Lonardi S, Jiang T (2005) Computing the assignment of orthologous genes via genome rearrangement. In: Proc of the 3rd Asia-Pacific bioinformatics conf (APBC’05), pp 363–378 CrossRefGoogle Scholar
  2. Christie DA, Irving RW (2001) Sorting strings by reversals and by transpositions. SIAM J Discrete Math 14(2):193–206 MathSciNetMATHCrossRefGoogle Scholar
  3. Chrobak M, Kolman P, Sgall J (2004) The greedy algorithm for the minimum common string partition problem. In: Proc of the 7th international workshop on approximation algorithms for combinatorial optimization problems (APPROX’04). LNCS, vol 3122, pp 84–95 Google Scholar
  4. Cormode G, Muthukrishnan S (2002) The string edit distance matching problem with moves. In: Proc of the 13th ACM-SIAM symposium on discrete algorithms (SODA’02), pp 667–676 Google Scholar
  5. Damaschke P (2008) Minimum common string partition parameterized. In: Proc of the 8th workshop on algorithms in bioinformatics (WABI’08). LNCS, vol 5251, pp 87–98 Google Scholar
  6. Downey R, Fellows M (1999) Parameterized complexity. Springer, Berlin CrossRefGoogle Scholar
  7. Flum J, Grohe M (2006) Parameterized complexity theory. Springer, Berlin Google Scholar
  8. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York MATHGoogle Scholar
  9. Goldstein A, Kolman P, Zheng J (2004) Minimum common string partitioning problem: Hardness and approximations. In: Proc of the 15th international symp on algorithms and computation (ISAAC’04). LNCS, vol 3341, pp 473–484. Also in: Electron J Comb 12, R50 (2005) Google Scholar
  10. Jiang H, Zheng C, Sankoff D, Zhu B (2010) Scaffold filling under the breakpoint distance. In: Proc of the 8th annual RECOMB satellite workshop on comparative genomics (RECOMB-CG’10). LNBI, vol 6398, pp 83–92 Google Scholar
  11. Kaplan H, Shafrir N (2006) The greedy algorithm for edit distance with moves. Inf Process Lett 97(1):23–27 MathSciNetMATHCrossRefGoogle Scholar
  12. Kolman P (2005) Approximating reversal distance for strings with bounded number of duplicates. In: Proc of the 30th international symposium on mathematical foundations of computer science (MFCS’05). LNCS, vol 3618, pp 580–590 Google Scholar
  13. Kolman P, Walen T (2006) Reversal distance for strings with duplicates: linear time approximation using hitting set. In: Proc 4th workshop on approximation and online algorithms (WAOA’06). LNCS, vol 4368, pp 279–289 CrossRefGoogle Scholar
  14. Kolman P, Walen T (2007) Approximating reversal distance for strings with bounded number of duplicates. Discrete Appl Math 155(3):327–336 MathSciNetMATHCrossRefGoogle Scholar
  15. Shapira D, Storer J (2002) Edit distance with move operations. In: Proc of the 13th annual symposium on combinatorial pattern matching (CPM’02). LNCS, vol 2373, pp 85–98 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Haitao Jiang
    • 1
    • 2
  • Binhai Zhu
    • 1
  • Daming Zhu
    • 2
  • Hong Zhu
    • 3
  1. 1.Department of Computer ScienceMontana State UniversityBozemanUSA
  2. 2.School of Computer Science and TechnologyShandong UniversityJinanChina
  3. 3.College of SoftwareEast China Normal UniversityShanghaiChina

Personalised recommendations