A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set

BACKGROUND: The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set L is known to be solvable in linear time. Existing approaches refine one input tree using information o...

Descripción completa

Detalles Bibliográficos
Autores principales: Schaller, David, Hellmuth, Marc, Stadler, Peter F.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2021
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8647445/
https://www.ncbi.nlm.nih.gov/pubmed/34872590
http://dx.doi.org/10.1186/s13015-021-00202-8

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8647445/
https://www.ncbi.nlm.nih.gov/pubmed/34872590
http://dx.doi.org/10.1186/s13015-021-00202-8

Ejemplares similares