Sorting Signed Circular Permutations by Super Short Reversals
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.
KeywordsFeasible Solution Yersinia Pestis Circular Permutation Rearrangement Event Signed Permutation
Unable to display preview. Download preview PDF.
- 2.Darling, A.E., Miklós, I., Ragan, M.A.: Dynamics of genome rearrangement in bacterial populations. PLoS Genetics 4(7), e1000128 (2008)Google Scholar
- 5.Galvão, G.R., Lee, O., Dias, Z.: Sorting signed permutations by short operations. Algorithms for Molecular Biology 10(12) (2015)Google Scholar
- 7.Lefebvre, J.F., El-Mabrouk, N., Tillier, E., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics 19(suppl 1), i190–i196 (2003)Google Scholar
- 9.Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4(1), 406–425 (1987)Google Scholar
- 10.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)CrossRefGoogle Scholar