Models of DNA evolution

This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (November 2010) (Learn how and when to remove this template message)

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.

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 only 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 rate-matrix 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 among-site rate-heterogeneity 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 continuous-time Markov chain[]

Continuous-time Markov chains[]

Continuous-time Markov chains have the usual transition matrices which are, in addition, parameterized by time, ${\displaystyle t}$. Specifically, if ${\displaystyle E_{1},E_{2},E_{3},E_{4}}$ are the states, then the transition matrix

${\displaystyle P(t)={\big (}P_{ij}(t){\big )}}$ where each individual entry, ${\displaystyle P_{ij}(t)}$ refers to the probability that state ${\displaystyle E_{i}}$ will change to state ${\displaystyle E_{j}}$ in time ${\displaystyle t}$.

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:

${\displaystyle P(t)={\begin{pmatrix}p_{\mathrm {AA} }(t)&p_{\mathrm {AG} }(t)&p_{\mathrm {AC} }(t)&p_{\mathrm {AT} }(t)\\p_{\mathrm {GA} }(t)&p_{\mathrm {GG} }(t)&p_{\mathrm {GC} }(t)&p_{\mathrm {GT} }(t)\\p_{\mathrm {CA} }(t)&p_{\mathrm {CG} }(t)&p_{\mathrm {CC} }(t)&p_{\mathrm {CT} }(t)\\p_{\mathrm {TA} }(t)&p_{\mathrm {TG} }(t)&p_{\mathrm {TC} }(t)&p_{\mathrm {TT} }(t)\end{pmatrix}}}$

where the top-left and bottom-right 2 × 2 blocks correspond to transition probabilities and the top-right and bottom-left 2 × 2 blocks corresponds to transversion probabilities.

Assumption: If at some time ${\displaystyle t_{0}}$, the Markov chain is in state ${\displaystyle E_{i}}$, then the probability that at time ${\displaystyle t_{0}+t}$, it will be in state ${\displaystyle E_{j}}$ depends only upon ${\displaystyle i}$, ${\displaystyle j}$ and ${\displaystyle t}$. This then allows us to write that probability as ${\displaystyle p_{ij}(t)}$.

Theorem: Continuous-time transition matrices satisfy:

${\displaystyle 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 for the change between two states. (ii) In the context of nucleotide changes in DNA sequences, transition is a specific term for 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 that the process is constant over time. For a particular site, let

${\displaystyle {\mathcal {E}}=\{A,\,G,\,C,\,T\}}$

be the set of possible states for the site, and

${\displaystyle \mathbf {p} (t)=(p_{A}(t),\,p_{G}(t),\,p_{C}(t),\,p_{T}(t))}$

their respective probabilities at time ${\displaystyle t}$. For two distinct ${\displaystyle x,y\in {\mathcal {E}}}$, let ${\displaystyle \mu _{xy}\ }$ be the transition rate from state ${\displaystyle x}$ to state ${\displaystyle y}$. Similarly, for any ${\displaystyle x}$, let the total rate of change from ${\displaystyle x}$ be

${\displaystyle \mu _{x}=\sum _{y\neq x}\mu _{xy}\,.}$

The changes in the probability distribution ${\displaystyle p_{A}(t)}$ for small increments of time ${\displaystyle \Delta t}$ are given by

${\displaystyle 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 ${\displaystyle A}$'s at time ${\displaystyle t+\Delta t}$ is equal to the frequency at time ${\displaystyle t}$ minus the frequency of the lost ${\displaystyle A}$'s plus the frequency of the newly created ${\displaystyle A}$'s.

Similarly for the probabilities ${\displaystyle p_{G}(t)}$, ${\displaystyle p_{C}(t)}$ and ${\displaystyle p_{T}(t)}$. These equations can be written compactly as

${\displaystyle \mathbf {p} (t+\Delta t)=\mathbf {p} (t)+\mathbf {p} (t)Q\Delta t\,,}$

where

${\displaystyle Q={\begin{pmatrix}-\mu _{A}&\mu _{AG}&\mu _{AC}&\mu _{AT}\\\mu _{GA}&-\mu _{G}&\mu _{GC}&\mu _{GT}\\\mu _{CA}&\mu _{CG}&-\mu _{C}&\mu _{CT}\\\mu _{TA}&\mu _{TG}&\mu _{TC}&-\mu _{T}\end{pmatrix}}}$

is known as the rate matrix. Note that, by definition, the sum of the entries in each row of ${\displaystyle Q}$ is equal to zero. It follows that

${\displaystyle \mathbf {p} '(t)=\mathbf {p} (t)Q\,.}$

For a stationary process, where ${\displaystyle Q}$ does not depend on time t, this differential equation can be solved. First,

${\displaystyle P(t)=\exp(tQ),}$

where ${\displaystyle \exp(tQ)}$ denotes the exponential of the matrix ${\displaystyle tQ}$. As a result,

${\displaystyle \mathbf {p} (t)=\mathbf {p} (0)P(t)=\mathbf {p} (0)\exp(tQ)\,.}$

Ergodicity[]

If the Markov chain is irreducible, i.e. if it is always possible to go from a state ${\displaystyle x}$ to a state ${\displaystyle y}$ (possibly in several steps), then it is also ergodic. As a result, it has a unique stationary distribution ${\displaystyle {\boldsymbol {\pi }}=\{\pi _{x},\,x\in {\mathcal {E}}\}}$, where ${\displaystyle \pi _{x}}$ corresponds to the proportion of time spent in state ${\displaystyle x}$ after the Markov chain has run for an infinite amount of time. In DNA evolution, under the assumption of a common process for each site, the stationary frequencies ${\displaystyle \pi _{A},\,\pi _{G},\,\pi _{C},\,\pi _{T}}$ correspond to equilibrium base compositions. Indeed, note that since the stationary distribution ${\displaystyle {\boldsymbol {\pi }}}$ satisfies ${\displaystyle {\boldsymbol {\pi }}Q=0}$, we see that when the current distribution ${\displaystyle \mathbf {p} (t)}$ is the stationary distribution ${\displaystyle {\boldsymbol {\pi }}}$ we have

${\displaystyle {\mathbf {p} '(t)=\mathbf {p} (t)Q={\boldsymbol {\pi }}}Q=0\,.}$

In other words, the frequencies of ${\displaystyle p_{A}(t),\,p_{G}(t),\,p_{C}(t),\,p_{T}(t)}$ do not change.

Time reversibility[]

Definition: A stationary Markov process is time reversible if (in the steady state) the amount of change from state ${\displaystyle x\ }$ to ${\displaystyle y\ }$ is equal to the amount of change from ${\displaystyle y\ }$ to ${\displaystyle x\ }$, (although the two states may occur with different frequencies). This means that:

${\displaystyle \pi _{x}\mu _{xy}=\pi _{y}\mu _{yx}\ }$

Not all stationary processes are reversible, however, most commonly used DNA evolution models assume time reversibility, which is considered to be a reasonable assumption.

Under the time reversibility assumption, let ${\displaystyle s_{xy}=\mu _{xy}/\pi _{y}\ }$, then it is easy to see that:

${\displaystyle s_{xy}=s_{yx}\ }$

Definition The symmetric term ${\displaystyle s_{xy}\ }$ is called the exchangeability between states ${\displaystyle x\ }$ and ${\displaystyle y\ }$. In other words, ${\displaystyle s_{xy}\ }$ is the fraction of the frequency of state ${\displaystyle x\ }$ that is the result of transitions from state ${\displaystyle y\ }$ to state ${\displaystyle x\ }$.

Corollary The 12 off-diagonal entries of the rate matrix, ${\displaystyle Q\ }$ (note the off-diagonal entries determine the diagonal entries, since the rows of ${\displaystyle Q\ }$ sum to zero) can be completely determined by 9 numbers; these are: 6 exchangeability terms and 3 stationary frequencies ${\displaystyle \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 in 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 rate-matrix (the Q matrix) represent -1 times the rate of leaving each state. For time-reversible 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:

${\displaystyle \beta =1/\left(-\sum _{i}\pi _{i}\mu _{ii}\right)}$

For example, in the Jukes-Cantor, 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)[]

JC69, the Jukes and Cantor 1969 model,^[1] is the simplest substitution model. There are several assumptions. It assumes equal base frequencies ${\displaystyle \left(\pi _{A}=\pi _{G}=\pi _{C}=\pi _{T}={1 \over 4}\right)}$ and equal mutation rates. The only parameter of this model is therefore ${\displaystyle \mu }$, the overall substitution rate. As previously mentioned, this variable becomes a constant when we normalize the mean-rate to 1.

${\displaystyle 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}}}$

Probability ${\displaystyle P_{ij}}$ of changing from initial state ${\displaystyle i}$ to final state ${\displaystyle j}$ as a function of the branch length (${\displaystyle \nu }$) for JC69. Red curve: nucleotide states ${\displaystyle i}$ and ${\displaystyle j}$ are different. Blue curve: initial and final states are the same. After a long time, probabilities tend to the nucleotide equilibrium frequencies (0.25: dashed line).

${\displaystyle P={\begin{pmatrix}{{1 \over 4}+{3 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}\\\\{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}+{3 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}\\\\{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}+{3 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}\\\\{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}-{1 \over 4}e^{-t\mu }}&{{1 \over 4}+{3 \over 4}e^{-t\mu }}\end{pmatrix}}}$

When branch length, ${\displaystyle \nu }$, is measured in the expected number of changes per site then:

${\displaystyle P_{ij}(\nu )=\left\{{\begin{array}{cc}{1 \over 4}+{3 \over 4}e^{-4\nu /3}&{\mbox{ if }}i=j\\{1 \over 4}-{1 \over 4}e^{-4\nu /3}&{\mbox{ if }}i\neq j\end{array}}\right.}$

It is worth noticing that ${\displaystyle \nu ={3 \over 4}t\mu =({\mu \over 4}+{\mu \over 4}+{\mu \over 4})t}$ what stands for sum of any column (or row) of matrix ${\displaystyle Q}$ multiplied by time and thus means expected number of substitutions in time ${\displaystyle t}$ (branch duration) for each particular site (per site) when the rate of substitution equals ${\displaystyle \mu }$.

Given the proportion ${\displaystyle p}$ of sites that differ between the two sequences the Jukes-Cantor estimate of the evolutionary distance (in terms of the expected number of changes) between two sequences is given by

${\displaystyle {\hat {d}}=-{3 \over 4}\ln({1-{4 \over 3}p})={\hat {\nu }}}$

The ${\displaystyle p}$ in this formula is frequently referred to as the ${\displaystyle p}$-distance. It is a sufficient statistic for calculating the Jukes-Cantor distance correction, but is not sufficient for the calculation of the evolutionary distance under the more complex models that follow (also note that ${\displaystyle p}$ used in subsequent formulae is not identical to the "${\displaystyle p}$-distance").

K80 model (Kimura 1980)[]

K80, the Kimura 1980 model,^[2] often referred to as Kimura's two parameter model (or the K2P model), distinguishes between transitions (${\displaystyle A\leftrightarrow G}$, i.e. from purine to purine, or ${\displaystyle C\leftrightarrow 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 (${\displaystyle \pi _{A}=\pi _{G}=\pi _{C}=\pi _{T}=0.25}$).

Rate matrix ${\displaystyle Q={\begin{pmatrix}{*}&{\kappa }&{1}&{1}\\{\kappa }&{*}&{1}&{1}\\{1}&{1}&{*}&{\kappa }\\{1}&{1}&{\kappa }&{*}\end{pmatrix}}}$ with columns corresponding to ${\displaystyle A}$, ${\displaystyle G}$, ${\displaystyle C}$, and ${\displaystyle T}$, respectively.

The Kimura two-parameter distance is given by:

${\displaystyle K=-{1 \over 2}\ln((1-2p-q){\sqrt {1-2q}})}$

where p is the proportion of sites that show transitional differences and q is the proportion of sites that show transversional differences.

K81 model (Kimura 1981)[]

K81, the Kimura 1981 model,^[3] often called Kimura's three parameter model (K3P model) or the Kimura three substitution type (K3ST) model, has distinct rates for transitions and two distinct types of transversions. The two transversion types are those that conserve the weak/strong properties of the nucleotides (i.e., ${\displaystyle A\leftrightarrow T}$ and ${\displaystyle C\leftrightarrow G}$, denoted by symbol ${\displaystyle \gamma }$ ^[3]) and those that conserve the amino/keto properties of the nucleotides (i.e., ${\displaystyle A\leftrightarrow C}$ and ${\displaystyle G\leftrightarrow T}$, denoted by symbol ${\displaystyle \beta }$ ^[3]). The K81 model assumes that all equilibrium base frequencies are equal (i.e., ${\displaystyle \pi _{A}=\pi _{G}=\pi _{C}=\pi _{T}=0.25}$).

Rate matrix ${\displaystyle Q={\begin{pmatrix}{*}&{\alpha }&{\beta }&{\gamma }\\{\alpha }&{*}&{\gamma }&{\beta }\\{\beta }&{\gamma }&{*}&{\alpha }\\{\gamma }&{\beta }&{\alpha }&{*}\end{pmatrix}}}$ with columns corresponding to ${\displaystyle A}$, ${\displaystyle G}$, ${\displaystyle C}$, and ${\displaystyle T}$, respectively.

The K81 model is used much less often than the K80 (K2P) model for distance estimation and it is seldom the best-fitting model in maximum likelihood phylogenetics. Despite these facts, the K81 model has continued to be studied in the context of mathematical phylogenetics.^[4][5][6] One important property is the ability to perform a Hadamard transform assuming the site patterns were generated on a tree with nucleotides evolving under the K81 model.^[7][8][9]

When used in the context of phylogenetics the Hadamard transform provides an elegant and fully invertible means to calculate expected site pattern frequencies given a set of branch lengths (or vice versa). Unlike many maximum likelihood calculations, the relative values for ${\displaystyle \alpha }$, ${\displaystyle \beta }$, and ${\displaystyle \gamma }$ can vary across branches and the Hadamard transform can even provide evidence that the data do not fit a tree. The Hadamard transform can also be combined with a wide variety of methods to accommodate among-sites rate heterogeneity,^[10] using continuous distributions rather than the discrete approximations typically used in maximum likelihood phylogenetics^[11] (although one must sacrifice the invertibility of the Hadamard transform to use certain among-sites rate heterogeneity distributions^[10]).

F81 model (Felsenstein 1981)[]

F81, the Felsenstein's 1981 model,^[12] is an extension of the JC69 model in which base frequencies are allowed to vary from 0.25 (${\displaystyle \pi _{A}\neq \pi _{G}\neq \pi _{C}\neq \pi _{T}}$)

Rate matrix:

${\displaystyle Q={\begin{pmatrix}{*}&{\pi _{G}}&{\pi _{C}}&{\pi _{T}}\\{\pi _{A}}&{*}&{\pi _{C}}&{\pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{*}&{\pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{\pi _{C}}&{*}\end{pmatrix}}}$

When branch length, ν, is measured in the expected number of changes per site then:

${\displaystyle \beta =1/(1-\pi _{A}^{2}-\pi _{C}^{2}-\pi _{G}^{2}-\pi _{T}^{2})}$

${\displaystyle 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)[]

HKY85, the Hasegawa, Kishino and Yano 1985 model,^[13] 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 (${\displaystyle \pi _{A}\neq \pi _{G}\neq \pi _{C}\neq \pi _{T}}$). [ Felsenstein described a similar (but not equivalent) model in 1984 using a different parameterization;^[14] that latter model is referred to as the F84 model.^[15] ]

Rate matrix ${\displaystyle Q={\begin{pmatrix}{*}&{\kappa \pi _{G}}&{\pi _{C}}&{\pi _{T}}\\{\kappa \pi _{A}}&{*}&{\pi _{C}}&{\pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{*}&{\kappa \pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{\kappa \pi _{C}}&{*}\end{pmatrix}}}$

If we express the branch length, ν in terms of the expected number of changes per site then:

${\displaystyle \beta ={\frac {1}{2(\pi _{A}+\pi _{G})(\pi _{C}+\pi _{T})+2\kappa [(\pi _{A}\pi _{G})+(\pi _{C}\pi _{T})]}}}$

${\displaystyle 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})}$

${\displaystyle P_{AC}(\nu ,\kappa ,\pi )=\pi _{C}\left(1.0-e^{-\beta \nu }\right)}$

${\displaystyle P_{AG}(\nu ,\kappa ,\pi )=\left[\pi _{G}\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]/\left(\pi _{A}+\pi _{G}\right)}$

${\displaystyle 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)[]

T92, the Tamura 1992 model,^[16] is a mathematical method developed to estimate the number of nucleotide substitutions per site between two DNA sequences, by extending Kimura's (1980) two-parameter method to the case where a G+C content bias exists. This method will be useful when there are strong transition-transversion and G+C-content biases, as in the case of Drosophila mitochondrial DNA.^[16]

T92 involves a single, compound base frequency parameter ${\displaystyle \theta \in (0,1)}$ (also noted ${\displaystyle \pi _{GC}}$) ${\displaystyle =\pi _{G}+\pi _{C}=1-(\pi _{A}+\pi _{T})}$

As T92 echoes the Chargaff's second parity rule — pairing nucleotides do have the same frequency on a single DNA strand, G and C on the one hand, and A and T on the other hand — it follows that the four base frequences can be expressed as a function of ${\displaystyle \pi _{GC}}$

${\displaystyle \pi _{G}=\pi _{C}={\pi _{GC} \over 2}}$ and ${\displaystyle \pi _{A}=\pi _{T}={(1-\pi _{GC}) \over 2}}$

Rate matrix ${\displaystyle Q={\begin{pmatrix}{*}&{\kappa \pi _{GC}/2}&{\pi _{GC}/2}&{(1-\pi _{GC})/2}\\{\kappa (1-\pi _{GC})/2}&{*}&{\pi _{GC}/2}&{(1-\pi _{GC})/2}\\{(1-\pi _{GC})/2}&{\pi _{GC}/2}&{*}&{\kappa (1-\pi _{GC})/2}\\{(1-\pi _{GC})/2}&{\pi _{GC}/2}&{\kappa \pi _{GC}/2}&{*}\end{pmatrix}}}$

The evolutionary distance between two DNA sequences according to this model is given by

${\displaystyle d=-h\ln(1-{p \over h}-q)-{1 \over 2}(1-h)\ln(1-2q)}$

where ${\displaystyle h=2\theta (1-\theta )}$ and ${\displaystyle \theta }$ is the G+C content (${\displaystyle \pi _{GC}=\pi _{G}+\pi _{C}}$).

TN93 model (Tamura and Nei 1993)[]

TN93, the Tamura and Nei 1993 model,^[17] distinguishes between the two different types of transition; i.e. (${\displaystyle A\leftrightarrow G}$) is allowed to have a different rate to (${\displaystyle C\leftrightarrow 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 (${\displaystyle \pi _{A}\neq \pi _{G}\neq \pi _{C}\neq \pi _{T}}$).

Rate matrix ${\displaystyle Q={\begin{pmatrix}{*}&{\kappa _{1}\pi _{G}}&{\pi _{C}}&{\pi _{T}}\\{\kappa _{1}\pi _{A}}&{*}&{\pi _{C}}&{\pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{*}&{\kappa _{2}\pi _{T}}\\{\pi _{A}}&{\pi _{G}}&{\kappa _{2}\pi _{C}}&{*}\end{pmatrix}}}$

GTR model (Tavaré 1986)[]

GTR, the Generalised time-reversible model of Tavaré 1986,^[18] 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.^[18]

GTR parameters consist of an equilibrium base frequency vector, ${\displaystyle \Pi =(\pi _{A},\pi _{G},\pi _{C},\pi _{T})}$, giving the frequency at which each base occurs at each site, and the rate matrix

${\displaystyle Q={\begin{pmatrix}{-(\alpha \pi _{G}+\beta \pi _{C}+\gamma \pi _{T})}&{\alpha \pi _{G}}&{\beta \pi _{C}}&{\gamma \pi _{T}}\\{\alpha \pi _{A}}&{-(\alpha \pi _{A}+\delta \pi _{C}+\epsilon \pi _{T})}&{\delta \pi _{C}}&{\epsilon \pi _{T}}\\{\beta \pi _{A}}&{\delta \pi _{G}}&{-(\beta \pi _{A}+\delta \pi _{G}+\eta \pi _{T})}&{\eta \pi _{T}}\\{\gamma \pi _{A}}&{\epsilon \pi _{G}}&{\eta \pi _{C}}&{-(\gamma \pi _{A}+\epsilon \pi _{G}+\eta \pi _{C})}\end{pmatrix}}}$

Where

${\displaystyle {\begin{aligned}\alpha =r(A\rightarrow G)=r(G\rightarrow A)\\\beta =r(A\rightarrow C)=r(C\rightarrow A)\\\gamma =r(A\rightarrow T)=r(T\rightarrow A)\\\delta =r(G\rightarrow C)=r(C\rightarrow G)\\\epsilon =r(G\rightarrow T)=r(T\rightarrow G)\\\eta =r(C\rightarrow T)=r(T\rightarrow C)\end{aligned}}}$

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 ${\displaystyle \mu }$, the overall number of substitutions per unit time. When measuring time in substitutions (${\displaystyle \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 ${\displaystyle {{n^{2}-n} \over 2}}$, and then add n for the equilibrium base frequencies, and subtract 1 because ${\displaystyle \mu }$ is fixed. One gets

${\displaystyle {{n^{2}-n} \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 ${\displaystyle 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 ${\displaystyle {{20\times 19\times 3} \over 2}+64-1=633}$ parameters.

See also[]

• Molecular evolution
• Molecular clock
• UPGMA

References[]

Further reading[]

External links[]

• DAWG: DNA Assembly With Gaps — free software for simulating sequence evolution