A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree

BACKGROUND: The ancestries of genes form gene trees which do not necessarily have the same topology as the species tree due to incomplete lineage sorting. Available algorithms determining the probability of a gene tree given a species tree require exponential computational runtime. RESULTS: In this...

Descripción completa

Detalles Bibliográficos
Autores principales: Stadler, Tanja, Degnan, James H
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3637458/
https://www.ncbi.nlm.nih.gov/pubmed/22546066
http://dx.doi.org/10.1186/1748-7188-7-7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3637458/
https://www.ncbi.nlm.nih.gov/pubmed/22546066
http://dx.doi.org/10.1186/1748-7188-7-7

Ejemplares similares