To use all functions of this page, please activate cookies in your browser.
With an accout for my.bionity.com you can always see everything at a glance – and you can configure your own website and individual newsletter.
- My watch list
- My saved searches
- My saved topics
- My newsletter
Models of DNA evolution
A number of different Markov models of DNA sequence evolution have been proposed. This is because evolutionary processes vary between genomes and between different regions of a genome, for example different evolutionary processes apply to coding and noncoding regions. These models mostly differ in the parametrization of the rate matrix and in the modeling of rate variation.
Additional recommended knowledge
DNA Evolution as a Continuous Time Markov Chain
Continuous Time Markov Chains
Continuous-time Markov chains have the usual transition matrices which are, in addition, parameterized by time, . Specifically, if are the states, then the transition matrix
Example: We would like to model the substitution process in DNA sequences (i.e. Jukes-Cantor, Kimura, etc.) in a continuous time fashion. The corresponding transition matrices will look like:
where the top-left and bottom-right blocks correspond to transition probabilities and the top-right and bottom-left blocks corresponds to transversion probabilities.
Assumption: If at some time , the Markov chain is in state , then the probability that at time , it will be in state depends only upon , and . This then allows us to write that probability as .
Theorem: Continuous-time transition matrices satisfy:
Deriving the Dynamics of Substitution
Consider a DNA sequence of fixed length m evolving in time by base replacement. Assume that the processes followed by the m sites are Markovian independent, identically distributed and constant in time. For a fixed site, let
be the column vector of probabilities of states and at time . Let
be the state-space. For two distinct
be the transition rate from state to state . Similarly, for any , let:
The changes in the probability distribution for small increments of time are given by:
In other words (in frequentist language), the frequency of 's at time is equal to the frequency at time minus the frequency of the lost 's plus the frequency of the newly created 's.
Similarly for the probabilities . We can write these compactly as:
where, is the rate matrix. Note that by definition, the rows of sum to zero.
If all the transition probabilities, are positive, i.e. if all states communicate, then the Markov chain has a stationary distribution where each is the proportion of time spent in state after the Markov chain has run for infinite time, and this probability does not depend upon the initial state of the process. Such a Markov chain is called, ergodic. In DNA evolution, under the assumption of a common process for each site, the stationary frequencies, correspond to equilibrium base compositions.
Definition A Markov process is stationary if its current distribution is the stationary distribution, i.e. Thus, by using the differential equation above,
Definition: A stationary Markov process is time reversible if (in the steady state) the amount of change from state to is equal to the amount of change from to , (although the two states may occur with different frequencies). This means that:
Not all stationary processes are reversible, however, almost all DNA evolution models assume time reversibility, which is considered to be a reasonable assumption.
Under the time reversibility assumption, let , then it is easy to see that:
Definition The symmetric term is called the exchangeability between states and . In other words, is the fraction of the frequency of state that results as a result of transitions from state to state .
Corollary The 12 off-diagonal enteries of the rate matrix, (note the off-diagonal enteries determine the diagonal enteries, since the rows of sum to zero) can be completely determined by 9 numbers; these are: 6 exchangeability terms and 3 stationary frequencies , (since the stationary frequencies sum to 1).
Most Common Models of DNA Evolution
JC69 model (Jukes and Cantor, 1969)
JC69 is the simplest substitution model. There are several assumptions. It assumes equal base frequencies () and equal mutation rates. The only parameter of this model is therefore μ, the overall substitution rate.
Distance between two sequences is given by
where p is the proportion of sites that differ between the two sequences.
K80 model (Kimura, 1980)
Distinguish between Transition(A <-> G within purines or T <-> C within pyrimidines) and Transversion(between purines and pyrimidines) (α/β)
Equal base frequencies ()
The Kimura two-parameter distance is given by:
where P is the proportion of sites that show transitional differences and Q is the proportion of sites that show transversional differences.
F81 model (Felsenstein 1981)
Unequal base frequencies ()
HKY85 model (Hasegawa, Kishino and Yano 1985)
Distinguish between Transition and Transversion (α/β)
Unequal base frequencies ()
T92 model (Tamura 1992)
One frequency only πGC
The evolutionary distance between two noncoding sequences according to this model is given by
where h = 2θ(1 − θ) where is the GC content.
TN93 model (Tamura and Nei 1993)
Distinguish between two different types of Transition (A <-> G) is different to (C<->T)
Unequal base frequencies ()
GTR: Generalised time reversible
GTR is the most general neutral, independent, finite-sites, time-reversible model possible. It was first described in a general form by Simon Tavaré in 1986.
The GTR parameters consist of an equilibrium base frequency vector, Π = (π1π2π3π4), giving the frequency at which each base occurs at each site, and the rate matrix
Therefore, GTR (for four characters, as is often the case in phylogenetics) requires 6 substitution rate parameters, as well as 4 equilibrium base frequency parameters. However, this is usually eliminated down to 9 parameters plus μ, the overall number of substitutions per unit time. When measuring time in substitutions (μ=1) only 9 free parameters remain.
In general, to compute the number of parameters, you count the number of entries above the diagonal in the matrix, i.e. for n trait values per site , and then add n for the equilibrium base frequencies, and subtract 1 because μ is fixed. You get
For example, for an amino acid sequence (there are 20 "standard" amino acids that make up proteins), you would find there are 209 parameters. However, when studying coding regions of the genome, it is more common to work with a codon substitution model (a codon is three bases and codes for one amino acid in a protein). There are 43 = 64 codons, but the rates for transitions between codons which differ by more than one base is assumed to be zero. Hence, there are parameters.
|This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Models_of_DNA_evolution". A list of authors is available in Wikipedia.|