Actas de congresos
Sorting Signed Circular Permutations By Super Short Reversals
Registro en:
978-3-319-19048-8; 978-3-319-19047-1
Sorting Signed Circular Permutations By Super Short Reversals. Springer-verlag Berlin, v. 9096, p. 272-283 2015.
0302-9743
WOS:000362026100023
10.1007/978-3-319-19048-8_23
Autor
Galvao
Gustavo Rodrigues; Baudet
Christian; Dias
Zanoni
Institución
Resumen
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. 9096
272 283