Sorting Circular Permutations by Super Short Reversals - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE/ACM Transactions on Computational Biology and Bioinformatics Année : 2017

Sorting Circular Permutations by Super Short Reversals

Résumé

We consider the problem of sorting a circular permutation by super short reversals (i.e., reversals of length at most 2), aproblem that finds application in comparative genomics. Polynomial-time solutions to the unsigned version of this problem are known,but the signed version remained open. In this paper, we present the first polynomial-time solution to the signed version of this problem.Moreover, we perform experiments for inferring phylogenies of two different groups of bacterial species and compare our results withthe phylogenies presented in previous works. Finally, to facilitate phylogenetic studies based on the methods studied in this paper, wepresent a web tool for rearrangement-based phylogenetic inference using short operations, such as super short reversals.
Fichier principal
Vignette du fichier
SortingCircularPermutationsBySuperShortReversals_author_version.pdf (547.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01317003 , version 1 (16-06-2017)

Identifiants

Citer

Gustavo Rodrigues Galvao, Christian Baudet, Zanoni Dias. Sorting Circular Permutations by Super Short Reversals. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017, 14 (3), pp.620-633. ⟨10.1109/TCBB.2016.2515594⟩. ⟨hal-01317003⟩
124 Consultations
360 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More