A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree
Open Access
- 30 April 2012
- journal article
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 7
Abstract
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.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescentJournal of Mathematical Biology, 2010
- Bayesian Inference of Species Trees from Multilocus DataMolecular Biology and Evolution, 2009
- Coalescent methods for estimating phylogenetic treesMolecular Phylogenetics and Evolution, 2009
- Estimating Species Phylogenies Using Coalescence Times among SequencesSystematic Biology, 2009
- Gene tree discordance, phylogenetic inference and the multispecies coalescentTrends in Ecology & Evolution, 2009
- STEM: species tree estimation using maximum likelihood for gene trees under coalescenceBioinformatics, 2009
- Properties of Consensus Methods for Inferring Species Trees from Gene TreesSystematic Biology, 2009
- PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationshipsBMC Bioinformatics, 2008
- Rooted triple consensus and anomalous gene treesBMC Ecology and Evolution, 2008
- BEAST: Bayesian evolutionary analysis by sampling treesBMC Ecology and Evolution, 2007