Enumerating all maximal frequent subtrees in collections of phylogenetic trees

BACKGROUND: A common problem in phylogenetic analysis is to identify frequent patterns in a collection of phylogenetic trees. The goal is, roughly, to find a subset of the species (taxa) on which all or some significant subset of the trees agree. One popular method to do so is through maximum agreem...

Descripción completa

Detalles Bibliográficos
Autores principales: Deepak, Akshay, Fernández-Baca, David
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4085724/
https://www.ncbi.nlm.nih.gov/pubmed/25061474
http://dx.doi.org/10.1186/1748-7188-9-16

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4085724/
https://www.ncbi.nlm.nih.gov/pubmed/25061474
http://dx.doi.org/10.1186/1748-7188-9-16

Ejemplares similares