On the Exact Block Cover Problem

  • Haitao Jiang
  • Bing Su
  • Mingyu Xiao
  • Yinfeng Xu
  • Farong Zhong
  • Binhai Zhu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8546)


Minimum Common String Partition (MCSP) has drawn a lot of attention due to its application in genome rearrangement. The best approximation algorithm has a factor O(lognlog* n) and it was shown most recently that it is FPT (but with a very high running time). In this paper, we consider the decision version of the one-sided MCSP problem (formally called the exact block cover problem); namely, when one sequence is already partitioned into k blocks, how to decide whether the other sequence can be partitioned accordingly. While this decision problem is obviously in FPT, we show interesting results in this paper: (1) If each letter is allowed to appear at most twice (or three times), then the problem is polynomially solvable, (2) There is an FPT algorithm which runs in O *(2 k ) time, improving the trivial bound of O *(k!), and (3) If |Σ| = c, c being a constant at least 2, then the problem is NP-complete.


Bipartite Graph Genome Rearrangement Dynamic Programming Algorithm Edit Distance Input String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bulteau, L., Fertin, G., Komusiewicz, C., Rusu, I.: A fixed-parameter algorithm for minimum common string partition with few duplications. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 244–258. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. ArXiv: CoRR abs/1305.0649 (2013)Google Scholar
  3. 3.
    Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Computing the assignment of orthologous genes via genome rearrangement. In: Proc. APBC 2005, pp. 363–378 (2005)Google Scholar
  4. 4.
    Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol. 3122, pp. 84–95. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proceedings of the 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 667–676 (2002)Google Scholar
  6. 6.
    Damaschke, P.: Minimum Common String Partition Parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 87–98. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)Google Scholar
  8. 8.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
  9. 9.
    Fu, B., Jiang, H., Yang, B., Zhu, B.: Exponential and polynomial time algorithms for the minimum common string partition problem. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 299–310. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)Google Scholar
  11. 11.
    Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 484–495. Springer, Heidelberg (2004); Also in: The Electronic Journal of Combinatorics 12, paper R50 (2005)Google Scholar
  12. 12.
    Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. of Combinatorial Optimization 23(4), 519–527 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1), 23–27 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Kolman, P., Waleń, T.: Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 279–289. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 580–590. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Kolman, P., Walen, T.: Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics 155(3), 327–336 (2007)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Haitao Jiang
    • 1
  • Bing Su
    • 2
  • Mingyu Xiao
    • 3
  • Yinfeng Xu
    • 4
  • Farong Zhong
    • 5
  • Binhai Zhu
    • 6
  1. 1.School of Computer Science and TechnologyShandong UniversityJinanChina
  2. 2.School of Economics and ManagementXi’an Technological UniversityXi’anChina
  3. 3.School of Computer Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengduChina
  4. 4.Business SchoolSichuan UniversityChengduChina
  5. 5.College of Math, Physics and Information TechnologyZhejiang Normal UniversityJinhuaChina
  6. 6.Department of Computer ScienceMontana State UniversityBozemanUSA

Personalised recommendations