On the Exact Block Cover Problem
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.
KeywordsBipartite Graph Genome Rearrangement Dynamic Programming Algorithm Edit Distance Input String
Unable to display preview. Download preview PDF.
- 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.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
- 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
- 7.Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)Google Scholar
- 8.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 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.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