The distance and median problems in the single-cut-or-join model with single-gene duplications

BACKGROUND. In the field of genome rearrangement algorithms, models accounting for gene duplication lead often to hard problems. For example, while computing the pairwise distance is tractable in most duplication-free models, the problem is NP-complete for most extensions of these models accounting...

Descripción completa

Detalles Bibliográficos
Autores principales: Mane, Aniket C., Lafond, Manuel, Feijao, Pedro C., Chauve, Cedric
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2020
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197181/
https://www.ncbi.nlm.nih.gov/pubmed/32391071
http://dx.doi.org/10.1186/s13015-020-00169-y

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197181/
https://www.ncbi.nlm.nih.gov/pubmed/32391071
http://dx.doi.org/10.1186/s13015-020-00169-y

Ejemplares similares