Presentation is loading. Please wait.

Presentation is loading. Please wait.

Cladogram Building - 1 ß How complex is this problem anyway ? ß NP-complete:  Time needed to find solution in- creases exponentially with size of problem.

Similar presentations

Presentation on theme: "Cladogram Building - 1 ß How complex is this problem anyway ? ß NP-complete:  Time needed to find solution in- creases exponentially with size of problem."— Presentation transcript:

1 Cladogram Building - 1 ß How complex is this problem anyway ? ß NP-complete:  Time needed to find solution in- creases exponentially with size of problem -> t = c n

2 Computational Complexity ß How do we proceed ? ß What about the quality of the solution ?  Optimality criterion  Exact and Exhaustive Enumeration Branch and Bound  (maybe) Off-Target and Incomplete Heuristics

3 Optimality - 1 ß Parsimony analysis:  comprises a group of related methods, united by the goal of optimizing some evolutionary significant quantity but differing in their underlying evolutionary assumptions.

4 Optimality - 2 ß How good is the solution :  What is its score [relative to alternatives]?. ß Relation of score to evolutionary assumptions  Fitch and Wagner Parsimony  Dollo Parsimony  Camin-Sokal Parsimony  Generalized Parsimony  Constrained Parsimony Group / Component Compatibility Character Compatibility

5 Exact and Exhaustive ß Enumeration is computationally unfeasible if # taxa is over, say, 10. ß Branch and Bound is computationally feasible for over 20 taxa (50 may even work).

6 (maybe) Off-Target and Incomplete ß Heuristics  Step-wise Addition  Star Decomposition  Branch Swapping

7 Step-wise Addition - 1 D A EC B E A DC B A B C BA CD BA CD B AC D A D B E C DE A BCBE C DA

8 Step-wise Addition - 2 ß Dependent on taxon sequence in data matrix. ß Excessively greedy. ß Susceptible to local optima.

9 Branch Swapping ß Local rearrangements of parts of cladogram  Nearest Neighbor Interchange  Subtree Pruning and Regrafting  Tree Bisection and Reconnection

10 Optimality - 3 Kind of Scores ß Length (number of steps) ß Consistency Index (CI) ß Retention index (RI) ß Corrected Extra Length (CEL) ß Redundancy Quotient ß AUCC ß HDR ß CCSI ß…ß…

11 Fitch & Wagner ß Characters: W: binary, ordered multistate, continuous F: unordered multistate ß Transformation: Free reversibility root and cladogram-length decoupled. Change in any direction equally probable (symmetry). W: intermediate states always involved. Thus 1 -> 3 implies 2 steps. F: Any state can transform into any other. Thus 1 -> 3 implies 1 step.

12 Wagner: Cladogram length - 1 B C A D E BC A DE 0 BC A DE 0,21,3 1,2 ?? ?

13 0 BC A DE Wagner: Cladogram length BC A DE 0,21,3 1, BC A DE

14 Fitch: Cladogram length A E D B C BC A DE 0,2 0 0, BC A DE

15 AB C D E Dollo: Multiple origins not allowed AB C D E

16 Generalized Parsimony a b c d abcdabcd Wagner a b c d abcdabcd Fitch M 2M 3M M 2M M a b c d abcdabcd Dollo A C G T ACGTACGT T-sition/T- version 1 Gain vs Loss

17 Models of Evolutionary Change ß Molecular Data ß Maximum Likelihood:  “Given the phylogeny, what is the probability to find the data as I did ?”  Substitution Types  Substitution Probabilities

18 Models: Substitution Types GTR TrNSYM HKY F84 K3ST F81 K2P JC T-versions; 2 T-sition class T-versions vs T-sitions Single substitution type Equal base frequencies T-versions; 2 T-sition class T-versions vs T-sitions Equal base freq’s

19 Substitution Types: What do they all mean ? ß GTR, e.g., stands for Generalized Time Reversible, meaning that the overall rate of change from base i to base j in a given length of time is the same as the rate of change from base j to base i. ß Each type corresponds to a table of substitution rates for all pairs of the nucleotides A, C, G, and T

20 Substitution Rate Table  Q = R +. X   A    C    G    T ACGTACGT A C G T  a  b  c  d  e  f A C G T ACGTACGT  g  h  i  j  k  l   A = frequency parameter    = mean instantaneous SR ß a, … k, l = relative rate parameters. ß All models can be obtained by restricting the parameters in R.

21 Models: Substitution Rates ß GTR: a=g, b=h, …, e=k, f=l ß TrN: a = c = d = f  K3ST:  A =  C =  G =  T = 1/4  JC: a = b = c = d = e = f = 1  A =  C =  G =  T = 1/4  A    C    G    T ACGTACGT A C G T  a  b  c  d  e  f A C G T ACGTACGT  g  h  i  j  k  l

22 Models: Substitution Probabilities ß P (t) = e Qt ß P is evaluated by decomposing Q into its eigenvalues and eigenvectors. ß We have a P for every branch t in the cladogram.

23 Rate vs Time ß All models:  P(i->j) depends on t and  through the product  t.  A branch can be long because it represents a long period of time OR because the rate of substitution has been high.  Impossible to tell apart, unless perfect mol. clock.

24 Rate + Time = Branch Length  If: Mean substitution rate  is set to 1. ß And: Relative rate parameters a, b, … f are scaled: -> average at equilibrium = 1 ß Then: Branch Length = expected number of substitutions per site.

25 Recap.  Evolution of DNA sequences is modeled by a stochastic process in which each site evolves in time (t) independently of all other sites, according to a Poisson process with rate .  Because the rate  only occurs in products of the form  t, the absolute value of  is arbitrary. ß Thus, all times should be considered relative to one another, and not as absolute values.  Products of the form  t represent expected amounts of change.

26 Likelihood of a Cladogram - 1 ß If: sites in the sequence evolve independently, ß Then: data represent multinomial sample. ß Thus: overall goodness- of-fit statistic is applicable (Log Likelihood Ratio Test).

27 Likelihood of a Cladogram - 2  Likelihood of Clado- gram  Likelihoods of occurrence of each state at each node as a function of cladogram topology and branch lengths. ß Cladogram is given: How good is it ?

28 Likelihood of a Cladogram - 3 ß The conditional likelihood of state i at sequence position j in taxon A is: L (  Aj =i) = [  P ik ( AB )L(  Bj =k)]. [  P il ( AC )L(  Cj =l )]

29 Likelihood of a Cladogram - 4 ß See figure 10 in SOWH.

30 Maximum Likelihood ß Pro: Consistency  As the number of items of data (n) increases, the probability that the estimator is far from the true value of the parameter (cladogram structure) decreases to zero. ß But:  Inferential consistency depends on the model.  Only finite amounts of data are considered, thus a ‘long-term’ property is not necessary.

31 Maximum Likelihood - 2 ß “ Anyone who considers this model (Poisson Process Model of DNA substitution) complex should bear in mind that it is the simplest mathematical model of state change with constant probabilities per unit time, and that a particular case (that of a very low rate of change) is used to justify parsimony methods. ß The model does not allow for insertions, deletions, and inversions.

32 When does ML = Parsimony ? ß They estimate different parameters, therefore the estimates cannot match exactly. ß For cladogram structure alone:  If PPM is correct, and we assume the expected amount of change,  t, to be very small, then the probability structures become the same.  For realistic values of  t, the two models do not behave identically.

33 Extensions of ML ß Rate heterogeneity among sites ß Other data types (except sequences)  gene frequencies  restriction sites ß Pairwise Distance Methods  immunological data  DNA-DNA hybridizations

Download ppt "Cladogram Building - 1 ß How complex is this problem anyway ? ß NP-complete:  Time needed to find solution in- creases exponentially with size of problem."

Similar presentations

Ads by Google