Abstract
Let S be a string built on some alphabet \(\varSigma \). A multi-cut rearrangement of S is a string \(S'\) obtained from S by an operation called k-cut rearrangement, that consists in (1) cutting S at a given number k of places in S, making S the concatenated string \(X_1\cdot X_2\cdot X_3\ldots X_k\cdot X_{k+1}\), where \(X_1\) and \(X_{k+1}\) are possibly empty, and (2) rearranging the \(X_i\)s so as to obtain \(S'=X_{\pi (1)}\cdot X_{\pi (2)}\cdot X_{\pi (3)}\ldots X_{\pi (k+1)}\), \(\pi \) being a permutation on \(1,2\ldots k+1\) satisfying \(\pi (1)=1\) and \(\pi (k+1)=k+1\). Given two strings S and T built on the same multiset of characters from \(\varSigma \), the Sorting by Multi-cut Rearrangements (SMCR) problem asks whether a given number \(\ell \) of \(k\)-cut rearrangements suffices to transform S into T. The SMCR problem generalizes and thus encompasses several classical genomic rearrangements problems, such as Sorting by Transpositions and Sorting by Block Interchanges. It may also model chromoanagenesis, a recently discovered phenomenon consisting in massive simultaneous rearrangements. In this paper, we study the SMCR problem from an algorithmic complexity viewpoint, and provide, depending on the respective values of k and \(\ell \), polynomial-time algorithms as well as NP-hardness, FPT-algorithms, W[1]-hardness and approximation results, either in the general case or when S and T are permutations.
GF was partially supported by the PHC Procope program 17746PC
GJ was partially supported by the PHC Procope program 17746PC
CK was partially supported by the DAAD Procope program 57317050.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272–289 (1996)
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discret. Math. 11(2), 224–240 (1998)
Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discrete Math. 26(3), 1148–1180 (2012)
Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5–7, 2014, pp. 102–121. SIAM (2014)
Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60(4), 165–169 (1996)
Christie, D.A.: Genome rearrangement problems. Ph.D. thesis, University of Glasgow (1998)
Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1
Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press, Computational molecular biology (2009)
Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1), 39–49 (2013)
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). https://doi.org/10.1007/978-3-540-30551-4_43
Pellestor, F., Gatinois, V.: Chromoanagenesis: a piece of the macroevolution scenario. Mol. Cytogenet. 13(3) (2020). https://doi.org/10.1186/s13039-020-0470-0
Stephens, P.J., et al.: Massive genomic rearrangement acquired in a single catastrophic event during cancer development. Cell 144, 27–40 (2011)
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
Bulteau, L., Fertin, G., Jean, G., Komusiewicz, C. (2021). Sorting by Multi-cut Rearrangements. In: Bureš, T., et al. SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science(), vol 12607. Springer, Cham. https://doi.org/10.1007/978-3-030-67731-2_43
Download citation
DOI: https://doi.org/10.1007/978-3-030-67731-2_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67730-5
Online ISBN: 978-3-030-67731-2
eBook Packages: Computer ScienceComputer Science (R0)