Sorting Signed Circular Permutations by Super Short Reversals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Sorting Signed Circular Permutations by Super Short Reversals

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.
Fichier principal
Vignette du fichier
SortingSignedCircularPermutationsBySuperShortReversals_author_version.pdf (332.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01316993 , version 1 (12-06-2017)

Identifiers

Cite

Gustavo R Galvão, Christian Baudet, Zanoni Dias. Sorting Signed Circular Permutations by Super Short Reversals. 11th International Symposium on Bioinformatics Research and Applications, Jun 2015, Norfolk, Virginia, United States. pp.272-283, ⟨10.1007/978-3-319-19048-8_23⟩. ⟨hal-01316993⟩
137 View
152 Download

Altmetric

Share

Gmail Facebook X LinkedIn More