An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree. 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.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Chauve, Cedric; Ponty, Yann; Wallner, Michael: Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models (2020)
- Himwich, Zoe M.; Rosenberg, Noah A.: Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees (2020)
- Disanto, Filippo; Rosenberg, Noah A.: Enumeration of compact coalescent histories for matching gene trees and species trees (2019)
- Rosenberg, Noah A.: Enumeration of lonely pairs of gene trees and species trees by means of antipodal cherries (2019)