Modeling Molecular Substitution - PowerPoint PPT Presentation

andrew
modeling molecular substitution l.
Skip this Video
Loading SlideShow in 5 Seconds..
Modeling Molecular Substitution PowerPoint Presentation
Download Presentation
Modeling Molecular Substitution

play fullscreen
1 / 26
Download Presentation
Modeling Molecular Substitution
531 Views
Download Presentation

Modeling Molecular Substitution

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Modeling Molecular Substitution Von Bing Yap Statistics Department, UC Berkeley yapvb@stat.berkeley.edu

  2. Variations on a theme Human genome project furnishes sequences from a few individuals, but is relevant to all of us: we are very similar. We are also slightly different: polymorphisms. Species variations.

  3. How did variations arise? Mutation: (a) Inherent: DNA replication errors are not always corrected. (b) External: exposure to chemicals and radiation. Selection: Deleterious mutations are removed quickly. Neutral and rarely, advantageous mutations, are tolerated and stick around … Fixation: It takes time for a new variant to be established (having a stable frequency) in a population.

  4. Why study molecular substitution? (Relatively) early days … to test hypotheses from population genetics. Do rodents evolve faster than primates (the generation time hypothesis) ? Which sites in a protein are under much selective pressure? More recently (from 70’s) …to derive better substitution matrices like the PAM and BLOSUM series for sequence alignment and building phylogenetic trees.

  5. ModelingDNA basesubstitution Strictly speaking, only applicable to regions undergoing little selection. Assumptions 1. Site independence. 2. Site homogeneity. 3. Markovian: given current base, future substitutions independent of past. 4. Temporal homogeneity: stationary Markov chain.

  6. Markov chain on {A,C,G,T} A stationary Markov chain is a family of transition probability matrices P(t), t  0, satisfying P(t)P(s) = P(t+s), t,s  0. P(t,a,b) = Pr(b at time s+t | a at time s). Let Q be a rate matrix, i.e., it has positive off-diagonal entries and each row sum is 0. Eg., Q(1,2) is the instantaneous rate of A going to C. Q defines an MC by P(t) = exp(Qt) = I + Q t + Q2t2/2! + …

  7. Jukes-Cantor model(1969) Let Q = Then P(t) = r = (1+3exp(-4t))/4, s = (1- exp(-4t))/4.

  8. The stationary distribution A probability distribution on {A,C,G,T}, , is a stationary distribution if a(a) P(t,a,b) = (b), b, t  0, or  P(t) = , t  0, or  Q = 0 (global balance). Facts: MC built from our Q has a unique stationary distribution. Let X(t) be the base at time t. If X(0) ~ , then X(t) ~ . Given any initial distribution, the distribution of X(t)   as t . For the JC model,  is the uniform distribution.

  9. A pair of homologous bases ancestor T years Qm Qh C A Typically, ancestor is unknown.

  10. More assumptions 5. Qh = sh Q and Qm = sm Q, for some positive sh and sm, and some rate matrix Q. 6. The ancestor is sampled from the stationary distribution  of Q. 7. Q is reversible: (a) P(t,a,b) = P(t,b,a) (b), b, t  0 (detailed balance).

  11. New picture ancestor ~  shT PAMs Q Q smT PAMs A C

  12. Joint probability of A and C Under the model, the joint probability is a (a) P(shT,a,A) P(smT,a,C) = a (A) P(shT,A,a) P(smT,a,C) = (A) P(shT+ smT,A,C) = F(t,A,C). The matrix F(t) is symmetric. It is equally valid to view A as the ancestor of C or vice versa. t = shT+ smT is the “distance” between A and C. Note: Q and t are identifiable from F(t), but sh , sm and T are not.

  13. Joint probability of a pair of homologous sequences Pr(a1…an,b1...bn) = k F(t,ak,bk) = a,b F(t,a,b)c(a,b), where c(a,b) = # {k : ak = a, bk = b}.

  14. The choice of Q By convention (Dayhoff 1978), Q is chosen to satisfy –a (a) Q(a,a) = 0.01, or the expected number of substitutions in 1 time unit is 0.01 per site. This new time scale is called evolutionary time, measured in PAM ( Point Accepted Mutation).

  15. M pairs of homologous sequences The kth pair of sequences, separated by tk PAMs, gives the count matrix c(k). Assuming that the pairs are independent and underwent the same MC defined by Q over pair-specific distances tk’s. Pr(all pairs) = k a,b F(tk,a,b)c(k,a,b). The pair-specific distances allow for different rates of substitution across pairs. Parameters : Q, t1, t2,…,tM. Maximum likelihood estimation by numerical methods.

  16. Previous work This model is general enough to include almost all models in use as special cases. For DNA base, there are JC, Kimura and Hasegawa-Kishino-Yano models. For amino acid, the PAM (Dayhoff 1978) and BLOSUM (Henikoff 1993) substitution matrices are derived based on the model. Müller and Vingron (2000) presents an interesting method of estimation. For codon, Z Yang and collaborators use constrained versions to estimate ratio of syn/nonsyn substitutions, among other things. .

  17. A formula for a reversible Q : stationary distribution of Q; ,…,: positive constants.

  18. Strand symmetry It seems plausible that the substitution process in noncoding regions is strand-symmetric, i.e., Q(A,C) = Q(T,G), Q(C,C) = Q(G,G), etc. From the point of view of sequence alignment, SS implies that the same substitution matrix can be used for aligning either strand. Strand-symmetry (of the lack of) is well-studied in bacteria (Francino, Ochman).

  19. A formula for a reversible SS Q : stationary distribution; 2((1) + (2)) = 1. ,…,: positive constants.

  20. Chromosome bands and human-mouse alignment Staining chromosomes with the Giemsa dye produces characteristic banding patterns. G-bands: G1, G2, G3 or G4 (Francke,1994). The unstained regions are H3- or H3+. Data: 22,490 local alignments (4.4 Mbp) of human chromosome 22 with homologous mouse reads, produced by blastz, and approximate boundary coordinates of the bands on chr 22, obtained from the UCSC Human genome browser.

  21. Data analysis Only alignments in noncoding regions are used. Alignments that are closer than 10 bases are glued. Of the resultant alignments, those longer than 100 bases are used to fit band-specific substitution models.

  22. Results R,SS R

  23. Amino acid substitution Exactly the same formulation applies to modeling amino acid substitution. Fast-evolving and slow-evolving proteins are known to have different substitution rates. How can we summarize such observations? Buried amino acids evolve differently from exposed residues. HMM with 2 hidden state?

  24. D. melanogastor vs virilis Bergman and Kreitman (2001) showed that the substitution patterns between intergenic and intronic regions are similar. The combined estimated rate matrix is

  25. Future work Study other human chromosomes, and isochore-specific substitution patterns. Multiple species. Holmes (2002) has a neat EM algorithm for estimating substitution rates if the process is reversible. What to do if irreversible? Even for 2 species, irreversible substitution models are not fully explored.

  26. Acknowledgements Terry Speed Webb Miller David Haussler Terry Furey Casey Bergman Anne Yap