Minimum Common String Partition Revisited
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 symbols in the alphabet; d-MCSP, which requires the occurrence of each symbol to be bounded by d; and x-balance MCSP, which requires the length of blocks not being x away from the average length. 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!) k ) 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-balance MCSP parameterized on both k and x.
KeywordsGreedy Algorithm Approximation Ratio Genome Rearrangement Edit Distance Input String
Unable to display preview. Download preview PDF.
- 1.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. of the 3rd Asia-Pacific Bioinformatics Conf. (APBC 2005), pp. 363–378 (2005)Google Scholar
- 8.Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partitioning problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 473–484. Springer, Heidelberg (2004); also in: The Electronic Journal of Combinatorics 12 (2005), paper R50Google Scholar