An efficient algorithm for testing the compatibility of phylogenies with nested taxa

BACKGROUND: Semi-labeled trees generalize ordinary phylogenetic trees, allowing internal nodes to be labeled by higher-order taxa. Taxonomies are examples of semi-labeled trees. Suppose we are given collection [Formula: see text] of semi-labeled trees over various subsets of a set of taxa. The ances...

Descripción completa

Detalles Bibliográficos
Autores principales: Deng, Yun, Fernández-Baca, David
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2017
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5356459/
https://www.ncbi.nlm.nih.gov/pubmed/28331536
http://dx.doi.org/10.1186/s13015-017-0099-7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5356459/
https://www.ncbi.nlm.nih.gov/pubmed/28331536
http://dx.doi.org/10.1186/s13015-017-0099-7

Ejemplares similares