1. Exact Computation of Coalescent Likelihood under the Infinite Sites Model Yufeng Wu University of Connecticut DIMACS Workshop on Algorithmics in Human Population-Genomics, 2009 1

2. Coalescent Likelihood D: a set of binary sequences. Coalescent genealogy: history with coalescent and mutation events. Coalescent likelihood P(D): probability of observing D on coalescent model given mutation rate Assume no recombination. Infinite many sites model of mutations. 00000 0001 0 011 00 1 0000 10001 1 5 2 3 4 Coalescent Mutation

3. Computing Coalescent Likelihood Computation of P(D): classic population genetics problem. Statistical (inexact) approaches: –Importance sampling (IS): Griffiths and Tavare (1994), Stephens and Donnelly (2000), Hobolth, Uyenoyama and Wiuf (2008). –MCMC: Kuhner,Yamato and Felsenstein (1995). Genetree: IS-based, widely used but (sometimes large) variance still exists. How feasible of computing exact P(D)? –Considered to be difficult for even medium-sized data (Song, Lyngso and Hein, 2006). This talk: exact computation of P(D) is feasible for data significantly larger than previously believed. –A simple algorithmic trick: dynamic programming 3

4. Ethier-Griffiths Recursion Build a perfect phylogeny for D. Ancestral configuration (AC): pairs of sequence multiplicity and list of mutations for each sequence type at some time Transition probability between ACs: depends on AC and. Genealogy: path of ACs (from present to root) P(D): sum of probability of all paths. EG: faster summation, backwards in time. (1, 0), (3, 4 0), (1, 3 2 0), (1, 1 0), (1, 5 1 0) (1, 0), (1, 0), (1, 3 2 0), (1, 1 0), (1, 5 1 0) (1, 0), (2, 4 0), (1, 3 2 0), (1, 1 0), (1, 5 1 0) (1, 0), (1, 4 0), (1, 3 2 0), (1, 1 0), (1, 5 1 0) (3, 4 0)

5. Computing Exact Likelihood Key idea: forward instead of backwards –Create all possible ACs reachable from the current AC (start from root). Update probability. –Intuition of AC: growing coverage of the phylogeny, starting from root Possible events at root: three branching (b 1, b 2, b 3 ), three mutations (m 1, m 2, m 4 ). Branching: cover new branch Covered branch can mutate Mutated branches covered branches (unless all branches are covered) Each event: a new AC b1b1 m2m2 b2b2 Start from root AC

6. Why Forward? Bottleneck: memory Layer of ACs: ACs with k mutation or branching events from root AC, k= 1,2,3… Key: only the current layer needs to be kept. Memory efficient. A single forward pass is enough to compute P(D). 6 Coalescent Mutation

7. Results on Simulated Data Use Hudsons program ms: 20, 30, 40 and 50 haplotypes with = 1, 3 and 5. Each settings: 100 datasets. How many allow exact computation of P(D) within reasonable amount of time? Number of haplotypes % of feasible data Number of haplotypes Ave. run time (sec.) for feasible data 7

8. Results on a Mitochondrial Data Mitochondrial data from Ward, et al. (1991). Previously analyzed by Griffiths and Tavare (1994) and others. –55 sequences and 18 polymorphic sites. –Believed to fit the infinite sites model. MLE of : 4.8 Griffiths and Tavare (1994) –Is 4.8 really the MLE? 8

9. Conclusion IS seems to work well for the Mitochondrial data –However, IS can still have large variance for some data. –Thus, exact computation may help when data is not very large and/or relatively low mutation rate. –Can also help to evaluate different statistical methods. Paper: in proceedings of ISBRA 2009. Research supported by National Science Foundation. 9