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...

Descripción completa

Detalles Bibliográficos
Autores principales: Baudet, Christian, Dias, Zanoni, Sagot, Marie-France
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Research
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

Internet

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