Abstract
We consider the problem of sorting a circular permutation by reversals of length at most 2, a problem that finds application in comparative genomics. Polynomial-time solutions for the unsigned version of this problem are known, but the signed version remained open. In this paper, we present the first polynomial-time solution for the signed version of this problem. Moreover, we perform an experiment for inferring distances and phylogenies for published Yersinia genomes and compare the results with the phylogenies presented in previous works.
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
Preview
Unable to display preview. Download preview PDF.
References
Dalevi, D.A., Eriksen, N., Eriksson, K., Andersson, S.G.E.: Measuring genome divergence in bacteria: A case study using chlamydian data. Journal of Molecular Evolution 55(1), 24–36 (2002)
Darling, A.E., Miklós, I., Ragan, M.A.: Dynamics of genome rearrangement in bacterial populations. PLoS Genetics 4(7), e1000128 (2008)
Egri-Nagy, A., Gebhardt, V., Tanaka, M.M., Francis, A.R.: Group-theoretic models of the inversion process in bacterial genomes. Journal of Mathematical Biology 69(1), 243–265 (2014)
Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press, Cambridge (2009)
Galvão, G.R., Lee, O., Dias, Z.: Sorting signed permutations by short operations. Algorithms for Molecular Biology 10(12) (2015)
Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36, 265–289 (1985)
Lefebvre, J.F., El-Mabrouk, N., Tillier, E., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics 19(suppl 1), i190–i196 (2003)
Lemey, P., Salemi, M., Vandamme, A.: The Phylogenetic Handbook: A Practical Approach to Phylogenetic Analysis and Hypothesis Testing. Cambridge University Press, New York (2009)
Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4(1), 406–425 (1987)
Seoighe, C., Federspiel, N., Jones, T., Hansen, N., Bivolarovic, V., Surzycki, R., Tamse, R., Komp, C., Huizar, L., Davis, R.W., Scherer, S., Tait, E., Shaw, D.J., Harris, D., Murphy, L., Oliver, K., Taylor, K., Rajandream, M.A., Barrell, B.G., Wolfe, K.H.: Prevalence of small inversions in yeast gene order evolution. Proceedings of the National Academy of Sciences of the United States of America 97(26), 14433–14437 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Galvão, G.R., Baudet, C., Dias, Z. (2015). Sorting Signed Circular Permutations by Super Short Reversals. In: Harrison, R., Li, Y., Măndoiu, I. (eds) Bioinformatics Research and Applications. ISBRA 2015. Lecture Notes in Computer Science(), vol 9096. Springer, Cham. https://doi.org/10.1007/978-3-319-19048-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-19048-8_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19047-1
Online ISBN: 978-3-319-19048-8
eBook Packages: Computer ScienceComputer Science (R0)