A number of different Markov models of DNA sequence evolution have been proposed. These substitution models differ in terms of the parameters used to describe the rates at which one nucleotide replaces another during evolution. These models are frequently used in molecular phylogenetic analyses. In particular, they are used during the calculation of likelihood of a tree (in Bayesian and maximum likelihood approaches to tree estimation) and they are used to estimate the evolutionary distance between sequences from the observed differences between the sequences.
Contents

Introduction 1

DNA evolution as a continuoustime Markov chain 2

Continuoustime Markov chains 2.1

Deriving the dynamics of substitution 2.2

Ergodicity 2.3

Time reversibility 2.4

Scaling of branch lengths 2.5

Most common models of DNA evolution 3

JC69 model (Jukes and Cantor, 1969) 3.1

K80 model (Kimura, 1980) 3.2

F81 model (Felsenstein 1981) 3.3

HKY85 model (Hasegawa, Kishino and Yano 1985) 3.4

T92 model (Tamura 1992) 3.5

TN93 model (Tamura and Nei 1993) 3.6

GTR: Generalised timereversible (Tavaré 1986) 3.7

See also 4

References 5

External links 6
Introduction
These models are phenomenological descriptions of the evolution of DNA as a string of four discrete states. These Markov models do not explicitly depict the mechanism of mutation nor the action of natural selection. Rather they describe the relative rates of different changes. For example, mutational biases and purifying selection favoring conservative changes are probably both responsible for the relatively high rate of transitions compared to transversions in evolving sequences. However, the Kimura (K80) model described below merely attempts to capture the effect of both forces in a parameter that reflects the relative rate of transitions to transversions.
Evolutionary analyses of sequences are conducted on a wide variety of time scales. Thus, it is convenient to express these models in terms of the instantaneous rates of change between different states (the Q matrices below). If we are given a starting (ancestral) state at one position, the model's Q matrix and a branch length expressing the expected number of changes to have occurred since the ancestor, then we can derive the probability of the descendant sequence having each of the four states. The mathematical details of this transformation from ratematrix to probability matrix are described in the mathematics of substitution models section of the substitution model page. By expressing models in terms of the instantaneous rates of change we can avoid estimating a large numbers of parameters for each branch on a phylogenetic tree (or each comparison if the analysis involves many pairwise sequence comparisons).
The models described on this page describe the evolution of a single site within a set of sequences. They are often used for analyzing the evolution of an entire locus by making the simplifying assumption that different sites evolve independently and are identically distributed. This assumption may be justifiable if the sites can be assumed to be evolving neutrally. If the primary effect of natural selection on the evolution of the sequences is to constrain some sites, then models of amongsite rateheterogeneity can be used. This approach allows one to estimate only one matrix of relative rates of substitution, and another set of parameters describing the variance in the total rate of substitution across sites.
DNA evolution as a continuoustime Markov chain
Continuoustime Markov chains
Continuoustime Markov chains have the usual transition matrices which are, in addition, parameterized by time, t\ . Specifically, if E_1,E_2,E_3,E_4\ are the states, then the transition matrix

P(t) = \big(P_{ij}(t)\big) where each individual entry, P_{ij}(t)\ refers to the probability that state E_i\ will change to state E_j\ in time t\ .
Example: We would like to model the substitution process in DNA sequences (i.e. Jukes–Cantor, Kimura, etc.) in a continuoustime fashion. The corresponding transition matrices will look like:

P(t) = \begin{pmatrix} p_{AA}(t) & p_{GA}(t) & p_{CA}(t) & p_{TA}(t) \\ p_{AG}(t) & p_{GG}(t) & p_{CG}(t) & p_{TG}(t) \\ p_{AC}(t) & p_{GC}(t) & p_{CC}(t) & p_{TC}(t) \\ p_{AT}(t) & p_{GT}(t) & p_{CT}(t) & p_{TT}(t) \end{pmatrix}
where the topleft and bottomright 2 × 2 blocks correspond to transition probabilities and the topright and bottomleft 2 × 2 blocks corresponds to transversion probabilities.
Assumption: If at some time t_0\ , the Markov chain is in state E_i\ , then the probability that at time t_0+t\ , it will be in state E_j\ depends only upon i\ , j\ and t\ . This then allows us to write that probability as p_{ij}(t)\ .
Theorem: Continuoustime transition matrices satisfy:


P(t+\tau) = P(t)P(\tau)\
Note: There is here a possible confusion between two meanings of the word transition. (i) In the context of Markov chains, transition is the general term that refers to the change between two states. (ii) In the context of nucleotide changes in DNA sequences, transition is a specific term that refers to the exchange between either the two purines (A ↔ G) or the two pyrimidines (C ↔ T) (for additional details, see the article about transitions in genetics). By contrast, an exchange between one purine and one pyrimidine is called a transversion.
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

\mathbf{P}(t) = (p_A(t),\ p_G(t),\ p_C(t),\ p_T(t))^T
be the column vector of probabilities of states A, \ \ G, \ \ C, \ and \ T \ at time t \ . Let

\mathcal{E} = \{A,\ G, \ C, \ T\}
be the statespace. For two distinct

x, y \in \mathcal{E}, let \mu_{xy}\
be the transition rate from state x\ to state y\ . Similarly, for any x\ , let:

\mu_x = \sum_{y\neq x}\mu_{xy}
The changes in the probability distribution p_A(t)\ for small increments of time \Delta t\ are given by:

p_A(t+\Delta t) = p_A(t)  p_A(t)\mu_A\Delta t + \sum_{x\neq A}p_x(t)\mu_{xA}\Delta t
In other words (in frequentist language), the frequency of A\ 's at time t + \Delta t\ is equal to the frequency at time t\ minus the frequency of the lost A\ 's plus the frequency of the newly created A\ 's.
Similarly for the probabilities p_G(t), \ p_C(t), \ \mathrm{and} \ p_T(t). We can write these compactly as:

\mathbf{P}(t+\Delta t) = \mathbf{P}(t) + Q\mathbf{P}(t)\Delta t
where,

Q = \begin{pmatrix} \mu_A & \mu_{GA} & \mu_{CA} & \mu_{TA} \\ \mu_{AG} & \mu_G & \mu_{CG} & \mu_{TG} \\ \mu_{AC} & \mu_{GC} & \mu_C & \mu_{TC} \\ \mu_{AT} & \mu_{GT} & \mu_{CT} & \mu_T \end{pmatrix}
or, alternately:

\mathbf{P}'(t) = Q\mathbf{P}(t)
where, Q\ is the rate matrix. Note that by definition, the columns of Q\ sum to zero. For a stationary process, where Q\ does not depend upon time t, this differential equation is solvable using matrix exponentiation:

P(t) = \exp(Qt) and

\mathbf{P}(t) = P(t)\mathbf{P}(0) = \exp(Qt)\mathbf{P}(0) \,.
Ergodicity
If all the transition probabilities, \mu_{xy}\ are positive, i.e. if all states x, y \in \mathcal{E}\ communicate, then the Markov chain has a unique stationary distribution \mathbf{\Pi} = \{\pi_x, \ x \in \mathcal{E} \} where each \pi_x \ is the proportion of time spent in state x\ after the Markov chain has run for infinite time. Such a Markov chain is called, ergodic. In DNA evolution, under the assumption of a common process for each site, the stationary frequencies, \pi_A, \pi_G, \pi_C, \pi_T \ correspond to equilibrium base compositions.
When the current distribution \mathbf{P}(t) is the stationary distribution \mathbf{\Pi}, then it follows that Q\mathbf{\Pi} = 0 using the differential equation above,

Q\mathbf{\Pi} = Q\mathbf{P}(t) = \frac{d\mathbf{P}(t)}{dt} = 0 \,.
Time reversibility
Definition: A stationary Markov process is time reversible if (in the steady state) the amount of change from state x\ to y\ is equal to the amount of change from y\ to x\ , (although the two states may occur with different frequencies). This means that:

\pi_x\mu_{xy} = \pi_y\mu_{yx} \
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 s_{xy} = \mu_{xy}/\pi_y\ , then it is easy to see that:

s_{xy} = s_{yx} \
Definition The symmetric term s_{xy}\ is called the exchangeability between states x\ and y\ . In other words, s_{xy}\ is the fraction of the frequency of state x\ that is the result of transitions from state y\ to state x\ .
Corollary The 12 offdiagonal entries of the rate matrix, Q\ (note the offdiagonal entries determine the diagonal entries, since the rows of Q\ sum to zero) can be completely determined by 9 numbers; these are: 6 exchangeability terms and 3 stationary frequencies \pi_x\ , (since the stationary frequencies sum to 1).
Scaling of branch lengths
By comparing extant sequences, one can determine the amount of sequence divergence. This raw measurement of divergence provides information about the number of changes that have occurred along the path separating the sequences. The simple count of differences (the Hamming distance) between sequences will often underestimate the number of substitution because of multiple hits (see homoplasy). Trying to estimate the exact number of changes that have occurred is difficult, and usually not necessary. Instead, branch lengths (and path lengths) in phylogenetic analyses are usually expressed in the expected number of changes per site. The path length is the product of the duration of the path in time and the mean rate of substitutions. While their product can be estimated, the rate and time are not identifiable from sequence divergence.
The descriptions of rate matrices on this page accurately reflect the relative magnitude of different substitutions, but these rate matrices are not scaled such that a branch length of 1 yields one expected change. This scaling can be accomplished by multiplying every element of the matrix by the same factor, or simply by scaling the branch lengths. If we use the β to denote the scaling factor, and ν to denote the branch length measured in the expected number of substitutions per site then βν is used the transition probability formulae below in place of μt. Note that ν is a parameter to be estimated from data, and is referred to as the branch length, while β is simply a number that can be calculated from the rate matrix (it is not a separate free parameter).
The value of β can be found by forcing the expected rate of flux of states to 1. The diagonal entries of the ratematrix (the Q matrix) represent 1 times the rate of leaving each state. For timereversible models, we know the equilibrium state frequencies (these are simply the π_{i} parameter value for state i). Thus we can find the expected rate of change by calculating the sum of flux out of each state weighted by the proportion of sites that are expected to be in that class. Setting β to be the reciprocal of this sum will guarantee that scaled process has an expected flux of 1:

\beta = 1/\left(\sum_i \pi_i\mu_{ii}\right)
For example, in the JukesCantor, the scaling factor would be 4/(3μ) because the rate of leaving each state is 3μ/4.
Most common models of DNA evolution
JC69 model (Jukes and Cantor, 1969)^{[1]}
JC69 is the simplest substitution model. There are several assumptions. It assumes equal base frequencies \left(\pi_A = \pi_G = \pi_C = \pi_T = {1\over4}\right) and equal mutation rates. The only parameter of this model is therefore \mu, the overall substitution rate. As previously mentioned, this variable becomes a constant when we normalize the meanrate to 1.

Q = \begin{pmatrix} {*} & {\mu\over 4} & {\mu\over 4} & {\mu\over 4} \\ {\mu\over 4} & {*} & {\mu\over 4}& {\mu\over 4}\\ {\mu\over 4}& {\mu\over 4}& {*} & {\mu\over 4}\\ {\mu\over 4}& {\mu\over 4}& {\mu\over 4}& {*} \end{pmatrix}

P= \begin{pmatrix} & & & \\\\ & & & \\\\ & & & \\\\ & & & \end{pmatrix}
When branch length, \nu, is measured in the expected number of changes per site then:

P_{ij}(\nu) = \left\{ \begin{array}{cc} {1\over4} + {3\over4}e^{4\nu/3} & \mbox{ if } i = j \\ {1\over4}  {1\over4}e^{4\nu/3} & \mbox{ if } i \neq j \end{array} \right.
It is worth noticing that \nu={3\over4}t\mu=({\mu\over4}+{\mu\over4}+{\mu\over4})t what stands for sum of any column (or row) of matrix Q multiplied by time and thus means expected number of substitutions in time t (branch duration) for each particular site (per site) when the rate of substitution equals \mu.
Given the proportion p of sites that differ between the two sequences the JukesCantor estimate of the evolutionary distance (in terms of the expected number of changes) between two sequences is given by

\hat{d}={3\over4} \ln({1{4\over3}p})=\hat{\nu}
The p in this formula is frequently referred to as the pdistance. It is a sufficient statistic for calculating the JukesCantor distance correction, but is not sufficient for the calculation of the evolutionary distance under the more complex models that follow (also note that p used in subsequent formulae is not identical to the "pdistance").
K80 model (Kimura, 1980)^{[2]}
The K80 model distinguishes between transitions (A <> G, i.e. from purine to purine, or C <> T, i.e. from pyrimidine to pyrimidine) and transversions (from purine to pyrimidine or vice versa). In Kimura's original description of the model the α and β were used to denote the rates of these types of substitutions, but it is now more common to set the rate of transversions to 1 and use κ to denote the transition/transversion rate ratio (as is done below). The K80 model assumes that all of the bases are equally frequent (π_{T}=π_{C}=π_{A}=π_{G}=0.25).
Rate matrix Q= \begin{pmatrix} {*} & {\kappa} & {1} & {1} \\ {\kappa} & {*} & {1} & {1} \\ {1} & {1} & {*} & {\kappa} \\ {1} & {1} & {\kappa} & {*} \end{pmatrix}
The Kimura twoparameter distance is given by:

\hat{d} =  {1\over2}\ln(12pq)  {1\over4} \ln (12q)
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)^{[3]}
Felsenstein's 1981 model is an extension of the JC69 model in which base frequencies are allowed to vary from 0.25 (\pi_T \ne \pi_C \ne \pi_A \ne \pi_G )
Rate matrix:

Q= \begin{pmatrix} {*} & {\pi_C} & {\pi_A} & {\pi_G} \\ {\pi_T} & {*} & {\pi_A} & {\pi_G} \\ {\pi_T} & {\pi_C} & {*} & {\pi_G} \\ {\pi_T} & {\pi_C} & {\pi_A} & {*} \end{pmatrix}
When branch length, ν, is measured in the expected number of changes per site then:

\beta = 1/(1\pi_A^2\pi_C^2\pi_G^2\pi_T^2)

P_{ij}(\nu) = \left\{ \begin{array}{cc} e^{\beta\nu}+\pi_j\left(1 e^{\beta\nu}\right) & \mbox{ if } i = j \\ \pi_j\left(1 e^{\beta\nu}\right) & \mbox{ if } i \neq j \end{array} \right.
HKY85 model (Hasegawa, Kishino and Yano 1985)^{[4]}
The HKY85 model can be thought of as combining the extensions made in the Kimura80 and Felsenstein81 models. Namely, it distinguishes between the rate of transitions and transversions (using the κ parameter), and it allows unequal base frequencies (\pi_T \ne \pi_C \ne \pi_A \ne \pi_G ). [ Felsenstein described a similar (but not equivalent) model in 1984 using a different parameterization;^{[5]} that latter model is referred to as the F84 model.^{[6]} ]
Rate matrix Q= \begin{pmatrix} {*} & {\kappa\pi_C} & {\pi_A} & {\pi_G} \\ {\kappa\pi_T} & {*} & {\pi_A} & {\pi_G} \\ {\pi_T} & {\pi_C} & {*} & {\kappa\pi_G} \\ {\pi_T} & {\pi_C} & {\kappa\pi_A} & {*} \end{pmatrix}
If we express the branch length, ν in terms of the expected number of changes per site then:

\beta = \frac{1}{2(\pi_A + \pi_G)(\pi_C + \pi_T) + 2\kappa[(\pi_A\pi_G) + (\pi_C\pi_T)]}

P_{AA}(\nu,\kappa,\pi) = \left[\pi_A\left(\pi_A + \pi_G + (\pi_C + \pi_T)e^{\beta\nu}\right) + \pi_G e^{(1 + (\pi_A + \pi_G)(\kappa  1.0))\beta\nu}\right]/(\pi_A + \pi_G)

P_{AC}(\nu,\kappa,\pi) = \pi_C\left(1.0  e^{\beta\nu}\right)

P_{AG}(\nu,\kappa,\pi) = \left[\pi_G\left(\pi_A + \pi_G + (\pi_C + \pi_T)e^{\beta\nu}\right)  \pi_Ge^{(1 + (\pi_A + \pi_G)(\kappa  1.0))\beta\nu}\right] /\left(\pi_A + \pi_G\right)

P_{AT}(\nu,\kappa,\pi) = \pi_T\left(1.0  e^{\beta\nu}\right)
and formula for the other combinations of states can be obtained by substituting in the appropriate base frequencies.
T92 model (Tamura 1992)^{[7]}
T92 is a simple mathematical method developed to estimate the number of nucleotide substitutions per site between two DNA sequences, by extending Kimura’s (1980) twoparameter method to the case where a G+Ccontent bias exists. This method will be useful when there are strong transitiontransversion and G+Ccontent biases, as in the case of Drosophila mitochondrial DNA. (Tamura 1992)
One frequency only \pi_{GC}
\pi_G = \pi_C = {\pi_{GC}\over 2}
\pi_A = \pi_T = {(1\pi_{GC})\over 2}
Rate matrix Q= \begin{pmatrix} {*} & {\kappa(1\pi_{GC})/2} & {(1\pi_{GC})/2} & {(1\pi_{GC})/2} \\ {\kappa\pi_{GC}/2} & {*} & {\pi_{GC}/2} & {\pi_{GC}/2} \\ {(1\pi_{GC})/2} & {(1\pi_{GC})/2} & {*} & {\kappa(1\pi_{GC})/2} \\ {\pi_{GC}/2} & {\pi_{GC}/2} & {\kappa\pi_{GC}/2} & {*} \end{pmatrix}
The evolutionary distance between two noncoding sequences according to this model is given by

d = h \ln(1{p\over h}q){1\over2}(1h)\ln(12q)
where h = 2\theta(1\theta) where \theta \in (0,1) is the GC content.
TN93 model (Tamura and Nei 1993)^{[8]}
The TN93 model distinguishes between the two different types of transition  i.e. (A <> G) is allowed to have a different rate to (C<>T). Transversions are all assumed to occur at the same rate, but that rate is allowed to be different from both of the rates for transitions.
TN93 also allows unequal base frequencies (\pi_T \ne \pi_C \ne \pi_A \ne \pi_G ).
Rate matrix Q= \begin{pmatrix} {*} & {\kappa_1\pi_C} & {\pi_A} & {\pi_G} \\ {\kappa_1\pi_T} & {*} & {\pi_A} & {\pi_G} \\ {\pi_T} & {\pi_C} & {*} & {\kappa_2\pi_G} \\ {\pi_T} & {\pi_C} & {\kappa_2\pi_A} & {*} \end{pmatrix}
GTR: Generalised timereversible (Tavaré 1986)^{[9]}
GTR is the most general neutral, independent, finitesites, timereversible model possible. It was first described in a general form by Simon Tavaré in 1986.^{[9]}
The GTR parameters consist of an equilibrium base frequency vector, \Pi = (\pi_1 , \pi_2 , \pi_3 , \pi_4), giving the frequency at which each base occurs at each site, and the rate matrix

Q = \begin{pmatrix} {(\alpha\pi_C + \beta\pi_A + \gamma\pi_G)} & {\alpha\pi_C} & {\beta\pi_A} & {\gamma\pi_G} \\ {\alpha\pi_T} & {(\alpha\pi_T + \delta\pi_A + \epsilon\pi_G)} & {\delta\pi_A} & {\epsilon\pi_G} \\ {\beta\pi_T} & {\delta\pi_C} & {(\beta\pi_T + \delta\pi_C + \eta\pi_G)} & {\eta\pi_G} \\ {\gamma\pi_T} & {\epsilon\pi_C} & {\eta\pi_A} & {(\gamma\pi_T + \epsilon\pi_C + \eta\pi_A)} \end{pmatrix}
Where
\begin{align} \alpha = r(T\rightarrow C) = r(C\rightarrow T)\\ \beta = r(T\rightarrow A) = r(A\rightarrow T)\\ \gamma = r(T\rightarrow G) = r(G\rightarrow T)\\ \delta = r(C\rightarrow A) = r(A\rightarrow C)\\ \epsilon = r(C\rightarrow G) = r(G\rightarrow C)\\ \eta = r(A\rightarrow G) = r(G\rightarrow A) \end{align}
are the transition rate parameters.
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 \mu, the overall number of substitutions per unit time. When measuring time in substitutions (\mu=1) only 8 free parameters remain.
In general, to compute the number of parameters, one must count the number of entries above the diagonal in the matrix, i.e. for n trait values per site {{n^2n} \over 2} , and then add n for the equilibrium base frequencies, and subtract 1 because \mu is fixed. One gets

{{n^2n} \over 2} + n  1 = {1 \over 2}n^2 + {1 \over 2}n  1.
For example, for an amino acid sequence (there are 20 "standard" amino acids that make up proteins), one 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 4^3 = 64 codons, but the rates for transitions between codons which differ by more than one base is assumed to be zero. Hence, there are {{20 \times 19 \times 3} \over 2} + 64  1 = 633 parameters.
See also
References

^ Jukes TH and Cantor CR (1969). Evolution of Protein Molecules. New York: Academic Press. pp. 21–132.

^ Kimura M (1980). "A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences". Journal of Molecular Evolution 16 (2): 111–120.

^ Felsenstein J (1981). "Evolutionary trees from DNA sequences: a maximum likelihood approach". Journal of Molecular Evolution 17 (6): 368–376.

^ Hasegawa M, Kishino H, Yano T (1985). "Dating of humanape splitting by a molecular clock of mitochondrial DNA". Journal of Molecular Evolution 22 (2): 160–174.

^ Kishino H, Hasegawa M (1989). "Evaluation of the maximum likelihood estimate of the evolutionary tree topologies from DNA sequence data, and the branching order in hominoidea". Journal of Molecular Evolution 29 (2): 170–179.

^ Felsenstein J, Churchill GA (1996). "A Hidden Markov Model approach to variation among sites in rate of evolution, and the branching order in hominoidea". Molecular Biology and Evolution 13 (1): 93–104.

^ Tamura K (1992). "Estimation of the number of nucleotide substitutions when there are strong transitiontransversion and G+C content biases". Molecular Biology and Evolution 9 (4): 678–687.

^ Tamura K, Nei M (1993). "Estimation of the number of nucleotide substitutions in the control region of mitochondrial DNA in humans and chimpanzees". Molecular Biology and Evolution 10 (3): 512–526.

^ ^{a} ^{b}
Further reading

Gu X, Li W (1992). "Higher rates of amino acid substitution in rodents than in man". Molecular Phylogenetics and Evolution 1 (3): 211–214.

Li WH, Ellsworth DL, Krushkal J, Chang BHJ, HewettEmmett D (1996). "Rates of nucleotide substitution in primates and rodents and the generationtime effect hypothesis". Molecular Phylogenetics and Evolution 5 (1): 182–187.
External links

DAWG: DNA Assembly With Gaps — free software for simulating sequence evolution
This article was sourced from Creative Commons AttributionShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, EGovernment Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a nonprofit organization.