Cargando…
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...
Autores principales: | Stadler, Tanja, Degnan, James H |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2012
|
Materias: | |
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 |
Ejemplares similares
-
TreeCmp: Comparison of Trees in Polynomial Time
por: Bogdanowicz, Damian, et al.
Publicado: (2012) -
Does Gene Tree Discordance Explain the Mismatch between Macroevolutionary Models and Empirical Patterns of Tree Shape and Branching Times?
por: Stadler, Tanja, et al.
Publicado: (2016) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
por: Arnold, Christian, et al.
Publicado: (2010) -
ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees
por: Zhang, Chao, et al.
Publicado: (2018) -
Discordance of Species Trees with Their Most Likely Gene Trees
por: Degnan, James H, et al.
Publicado: (2006)