2008
DOI: 10.1534/genetics.107.085753
|View full text |Cite
|
Sign up to set email alerts
|

A Two-Stage Pruning Algorithm for Likelihood Computation for a Population Tree

Abstract: We have developed a pruning algorithm for likelihood estimation of a tree of populations. This algorithm enables us to compute the likelihood for large trees. Thus, it gives an efficient way of obtaining the maximum-likelihood estimate (MLE) for a given tree topology. Our method utilizes the differences accumulated by random genetic drift in allele count data from single-nucleotide polymorphisms (SNPs), ignoring the effect of mutation after divergence from the common ancestral population. The computation of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
95
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 49 publications
(95 citation statements)
references
References 20 publications
0
95
0
Order By: Relevance
“…It may be fruitful to adapt the Bayesian framework presented here to infer the historical relationships between the sampled populations. For example, the drift on different branches of a tree of populations could be approximated by normal deviations, which would allow rapid calculation of the branch lengths (see RoyChoudhury et al 2008 for a recent presentation of the problem). However, the pairwise covariance of allele frequencies across populations can be used only to learn about the average coalescent times within and between pairs of populations (Slatkin 1991) and so this approach could not be directly used to distinguish between isolation models and migration models (see McVean 2009, for discussion).…”
Section: Discussionmentioning
confidence: 99%
“…It may be fruitful to adapt the Bayesian framework presented here to infer the historical relationships between the sampled populations. For example, the drift on different branches of a tree of populations could be approximated by normal deviations, which would allow rapid calculation of the branch lengths (see RoyChoudhury et al 2008 for a recent presentation of the problem). However, the pairwise covariance of allele frequencies across populations can be used only to learn about the average coalescent times within and between pairs of populations (Slatkin 1991) and so this approach could not be directly used to distinguish between isolation models and migration models (see McVean 2009, for discussion).…”
Section: Discussionmentioning
confidence: 99%
“…We have used a pruning algorithm similar to other species tree computations (9,(40)(41)(42)(43)(44) that evaluate a quantity at a parent node in terms of corresponding values for daughter nodes. In previous applications of this idea, the states recorded at a node are generally simpler than our input and output states.…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, we eliminate the past restriction (4) that the lineages whose monophyly is examined all derive from the same population. This generalization is analogous to the assumption that in computing the probability of a binary evolutionary character (40)(41)(42), one or both character states can appear in multiple species. Our approach uses a pruning algorithm, generalizing the two-species formula in a conceptually similar manner to other recursive coalescent computations on arbitrary trees (9,(40)(41)(42)(43)(44).…”
mentioning
confidence: 99%
“…The expectations of various quantities can be derived under a model without migration (Wakeley and Hey, 1997), and the likelihood of a particular configuration of allele counts at a locus may be computed analytically for a model with no migration and where mutation since divergence can be ignored (e.g. Nielsen and Slatkin, 2000;Nicholson et al, 2002;RoyChoudhury et al, 2008), or alternatively can be estimated accurately under more general models using coalescent simulations.…”
Section: Types Of Datamentioning
confidence: 99%