a polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree一个多项式时间算法计算排名的概率基因树给定物种树.pdfVIP

Stadler and Degnan Algorithms for Molecular Biology 2012, 7:7 /content/7/1/7 RESEARCH Open Access A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree Tanja Stadler 1* and James H Degnan2,3 Abstract 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 paper, we provide a polynomial time algorithm to calculate the probability of a ranked gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The probability of a gene tree topology can thus be calculated in polynomial time if the number of orderings of the internal vertices is a polynomial number. However, the complexity of calculating the probability of a gene tree topology with an exponential number of rankings for a given species tree remains unknown. Conclusions: Polynomial algorithms for calculating ranked gene tree probabilities may become useful in developing methodology to infer species trees based on a collection of gene trees, leading to a more accurate reconstruction of ancestral species relationships. Keywords: Incomplete lineage sorting, Coalescent history, Anomalous gene tree, Dynamic programming Background Figure 1b do not coalesce until the population ancestral Phylogenetic reconstruction methods aim to infer the to species A, B, and C, thus allowing the B and C lineages species phylogeny which gave rise to a group of extant in the gene tree to have a more rece