Unknown

Dataset Information

0

An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree.


ABSTRACT:

Motivation

Gene tree represents the evolutionary history of gene lineages that originate from multiple related populations. Under the multispecies coalescent model, lineages may coalesce outside the species (population) boundary. Given a species tree (with branch lengths), the gene tree probability is the probability of observing a specific gene tree topology under the multispecies coalescent model. There are two existing algorithms for computing the exact gene tree probability. The first algorithm is due to Degnan and Salter, where they enumerate all the so-called coalescent histories for the given species tree and the gene tree topology. Their algorithm runs in exponential time in the number of gene lineages in general. The second algorithm is the STELLS algorithm (2012), which is usually faster but also runs in exponential time in almost all the cases.

Results

In this article, we present a new algorithm, called CompactCH, for computing the exact gene tree probability. This new algorithm is based on the notion of compact coalescent histories: multiple coalescent histories are represented by a single compact coalescent history. The key advantage of our new algorithm is that it runs in polynomial time in the number of gene lineages if the number of populations is fixed to be a constant. The new algorithm is more efficient than the STELLS algorithm both in theory and in practice when the number of populations is small and there are multiple gene lineages from each population. As an application, we show that CompactCH can be applied in the inference of population tree (i.e. the population divergence history) from population haplotypes. Simulation results show that the CompactCH algorithm enables efficient and accurate inference of population trees with much more haplotypes than a previous approach.

Availability

The CompactCH algorithm is implemented in the STELLS software package, which is available for download at http://www.engr.uconn.edu/ywu/STELLS.html

Contact

ywu@engr.uconn.edu

Supplementary information

Supplementary data are available at Bioinformatics online.

SUBMITTER: Wu Y 

PROVIDER: S-EPMC4908345 | biostudies-literature | 2016 Jun

REPOSITORIES: biostudies-literature

altmetric image

Publications

An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree.

Wu Yufeng Y  

Bioinformatics (Oxford, England) 20160601 12


<h4>Motivation</h4>Gene tree represents the evolutionary history of gene lineages that originate from multiple related populations. Under the multispecies coalescent model, lineages may coalesce outside the species (population) boundary. Given a species tree (with branch lengths), the gene tree probability is the probability of observing a specific gene tree topology under the multispecies coalescent model. There are two existing algorithms for computing the exact gene tree probability. The firs  ...[more]

Similar Datasets

| S-EPMC9248896 | biostudies-literature
| S-EPMC4856265 | biostudies-literature
| S-EPMC4341064 | biostudies-literature
| S-EPMC6956792 | biostudies-literature
| S-EPMC4207426 | biostudies-literature
| S-EPMC6404246 | biostudies-literature
| S-EPMC5837799 | biostudies-literature
| S-EPMC4949727 | biostudies-literature
| S-EPMC4296144 | biostudies-literature
| S-EPMC5320999 | biostudies-other