A scalable method for identifying frequent subtrees in sets of large phylogenetic trees

BACKGROUND: We consider the problem of finding the maximum frequent agreement subtrees (MFASTs) in a collection of phylogenetic trees. Existing methods for this problem often do not scale beyond datasets with around 100 taxa. Our goal is to address this problem for datasets with over a thousand taxa...

Descripción completa

Detalles Bibliográficos
Autores principales: Ramu, Avinash, Kahveci, Tamer, Burleigh, J Gordon
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3543182/
https://www.ncbi.nlm.nih.gov/pubmed/23033843
http://dx.doi.org/10.1186/1471-2105-13-256

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3543182/
https://www.ncbi.nlm.nih.gov/pubmed/23033843
http://dx.doi.org/10.1186/1471-2105-13-256

Ejemplares similares