Abstract
We introduce and study a new combinatorial problem based on the famous Minimum Common String Partition (MCSP) problem, which we call Permutation-constrained Common String Partition (PCSP for short). In PCSP, we are given two sequences/genomes s and t with the same length and a permutation \(\pi \) on [k], the question is to decide whether it is possible to decompose s and t into k blocks that conform with the permutation \(\pi \). The main result of this paper is that if s and t are both d-occurrence (i.e., each letter/gene appears at most d times in s and t), then PCSP is FPT. We also study a variant where the input specifies whether each matched pair of block needs to be preserved as is, or reversed. With this result on PCSP, we show that a series of genome rearrangement problems are FPT as long as the input genomes are d-occurrence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bulteau, L., Fellows, M., Komusiewicz, C., Rosamond, F.: Parameterized string equations. arXiv arXiv:2104.14171 (2021)
Bulteau, L., Fertin, G., Jean, G., Komusiewicz, C.: Sorting by multi-cut rearrangements. In: Bureš, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 593–607. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-67731-2_43
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). https://doi.org/10.1007/978-3-642-40453-5_19
Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discret. Math. 26(3), 1148–1180 (2012). https://doi.org/10.1137/110851390
Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 102–121. SIAM (2014)
Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discret. Math. 12(1), 91–110 (1999). https://doi.org/10.1137/S089548019731994X
Chen, X., et al.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinform. 2(4), 302–315 (2005). https://doi.org/10.1109/TCBB.2005.48
Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60(4), 165–169 (1996). https://doi.org/10.1016/S0020-0190(96)00155-X
Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. Discret. Math. 14(2), 193–206 (2001). https://doi.org/10.1137/S0895480197331995
Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1(2), 350–366 (2005). https://doi.org/10.1145/1103963.1103971
Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 87–98. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87361-7_8
Ganczorz, M., Gawrychowski, P., Jez, A., Kociumaka, T.: Edit distance with block operations. In: Proceedings of ESA 2018, LIPIcs, vol. 112, pp. 33:1–33:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: hardness and approximations. Eur. J. Combin. 12, R50 (2005)
Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. Comb. Optim. 23(4), 519–527 (2012). https://doi.org/10.1007/s10878-010-9370-2
Lafond, M., Zhu, B., Zou, P.: Genomic problems involving copy number profiles: Complexity and algorithms. In: Proceedings of CPM 2020, LIPIcs, vol. 161, pp. 22:1–22:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2020)
Lafond, M., Zhu, B., Zou, P.: The tandem duplication distance is NP-hard. In: Proceedings of STACS 2020, LIPIcs, vol. 154, pp. 15:1–15:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2020)
Mahajan, M., Rama, R., Raman, V., Vijaykumar, S.: Approximate block sorting. Int. J. Found. Comput. Sci. 17(2), 337–356 (2006). https://doi.org/10.1142/S0129054106003863
Makaroff, C., Palmer, J.: Mitochondrial DNA rearrangements and transcriptional alternatives in the male sterile cytoplasm of Ogura radish. Mol. Cell. Biol. 8, 1474–1480 (1988)
Qingge, L., He, X., Liu, Z., Zhu, B.: On the minimum copy number generation problem in cancer genomics. In: Proceedings of the 10th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2018, pp. 260–269. ACM Press, New York (2018). https://doi.org/10.1145/3233547.3233586
Sturtevant, A.: A crossover reducer in drosophila melanogaster due to inversion of a section of the third chromosome. Biol. Zent. Bl. 46, 697–702 (1926)
Sturtevant, A., Dobzhansky, T.: Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. Proc. Nat. Acad. Sci. U.S.A. 22, 448–450 (1936)
Zheng, C., Kerr Wall, P., Leebens-Mack, J., de Pamphilis, C., Albert, V.A., Sankoff, D.: Gene loss under neighborhood selection following whole genome duplication and the reconstruction of the ancestral Populus genome. J. Bioinform. Comput. Biol. 7(03), 499–520 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Lafond, M., Zhu, B. (2021). Permutation-Constrained Common String Partitions with Applications. In: Lecroq, T., Touzet, H. (eds) String Processing and Information Retrieval. SPIRE 2021. Lecture Notes in Computer Science(), vol 12944. Springer, Cham. https://doi.org/10.1007/978-3-030-86692-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-86692-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86691-4
Online ISBN: 978-3-030-86692-1
eBook Packages: Computer ScienceComputer Science (R0)