Cargando…
Sampling solution traces for the problem of sorting permutations by signed reversals
BACKGROUND: Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the origi...
Autores principales: | Baudet, Christian, Dias, Zanoni, Sagot, Marie-France |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3537553/ https://www.ncbi.nlm.nih.gov/pubmed/22704580 http://dx.doi.org/10.1186/1748-7188-7-18 |
Ejemplares similares
-
Sorting signed permutations by short operations
por: Galvão, Gustavo Rodrigues, et al.
Publicado: (2015) -
Sorting signed circular permutations by super short operations
por: Oliveira, Andre R., et al.
Publicado: (2018) -
Sorting by weighted inversions considering length and symmetry
por: Baudet, Christian, et al.
Publicado: (2015) -
An asymmetric approach to preserve common intervals while sorting by reversals
por: Braga, Marília DV, et al.
Publicado: (2009) -
Cassis: detection of genomic rearrangement breakpoints
por: Baudet, Christian, et al.
Publicado: (2010)