Jukes Cantor Model of DNA substitution

We have had a series of posts introducing several foundational tools in phylogenetic inference including Bayesian reasoning, Markov Chain Monte Carlo, and the gamma distribution’s many uses in phylogenetics. Today, we’ll continue with this theme in a crosspost from my UH colleague Floyd Reed‘s laboratory blog. Here, Floyd gives a simple derivation of the Jukes Cantor model of DNA substitution. Here it is in lightly edited form:

In previous posts I talked about irreversible and reversible mutations between two states or alleles.  However, there are four nucleotides, A, C, G, and T.  How can we model mutations among these four states at a single nucleotide site?  It turns out that this is important to consider for things like making gene trees to represent species relationships.  If we just use the raw number of differences between two species’ DNA sequences we can get misleading results.  It is actually better to estimate and correct for the total number of changes that have occurred, some fraction of which may not be visible to us.  The simplest way to do this is the Jukes-Cantor (1969) model.

Imagine a nucleotide can mutate with the same probability to any other nucleotide, so that the mutation rates in all directions are equal and symbolized by \mu.

jukes-cantor

So from the point of view of the “A” state you can mutate away with a probability of 3\mu (lower left above).  However, another state will only mutate to an “A” with a probability of \mu (lower right above); the “T” could have just as easily mutated to a “G” or “C” instead of an “A”.

When we talked about the reversible mutations one result was that the equilibrium frequency of a state was the rate of mutation to that state divided by the total rates of all mutations.  We can see above that there is one \mu moving toward “A” from a specific state and 3\mu moving away.  This gives 1\mu/(3\mu+1\mu) or 1/4 as the predicted frequency of “A” in a DNA sequence at equilibrium, which makes sense, if mutations occur in all directions at equal frequencies then we expect 25% of the nucleotides to consist of “A’s”.  This is also true if we look at all the possible mutations simultaneously.

jc-equilibrium

There are three paths to “A” and nine other paths for a total of 12.  3/12=1/4.

Now it’s time to talk about the Poisson distribution.  This is a convenient distribution to use in many cases where the probability of an individual event is rare, events occur independently, and we are thinking about intervals of continuous time (or space).  Classic examples are the number of people in a line at the bank per hour, or the number of letters received in the mail per day, or the number of Prussian soldiers killed each year by horse kicks, or less classic, for example, the number of meteors larger than 10 meters in diameter that impact Earth’s atmosphere each decade (this happens to be slightly less than one on average).

The probability of each number, k , of events can be calculated given the average expected number,  \lambda, according to:

P(k | \lambda) = \frac{\lambda^k e^{-\lambda}}{k!}

So, if on average we expect \lambda=1.5 events, the probability of zero, one, two, etc. events looks like this:

poisson-mean-1p5

In words, the probability of no events is 22.3%, one event is 33.5%, two events is 25.1%, three events (twice the average) is 12.6%, … seven events is less than 0.1% and the probability of eight or more events, given the average is 1.5, is practically zero.

Of special interest is the probability of no events, k=0 .  Then the equation simplifies to:

P(0 | \lambda) = e^{-\lambda}

So, as the mean increases (x-axis below) the probability of zero events (y-axis) drops according to an exponential distribution.

poisson-zero

By definition, the total probability of all possible outcomes must sum to one, “something has to happen, even if it is nothing.”  So the probability of one or more events (at least one event) is one minus the probability that it did not mutate, which is the probability complement of P(0|\lambda) , which can be written as P(\neg0|\lambda) (the probability that there are not zero events given the expected number of events):

P( \lnot 0 | \lambda) = 1 - P(0 | \lambda) = 1 - e^{-\lambda}

To bring this back to mutations, we expect some number of mutations to occur over an interval of time.  So we multiply the mutation rate, \mu , by time, t , to get an expectation. Starting at one site, there are three possible paths moving away, so there are three opportunities for mutation, so it seems that each time step the mutation rate is 3\mu .

However, for mathematical convenience we are going to add a strange possibility.  It is easier to work backwards and say if the site did mutate at least once, the probability it mutated to a “G,” for example, in the last step is 1/4, no matter how many total mutation steps occurred.  But this is not true under the model we drew above if the site was a “G” before mutating.  The same state can not mutate to the same state, or it wouldn’t be a mutation as we understand it.  Anyway, let’s allow for the time being the possibility that a site can “mutate” back to itself, also at rate \mu.  So we get a visual model like this:

jc-revised

Now the potential for mutation each time step is 4\mu .

This is the mean of the Poisson, \lambda=4\mu t.

Actually there is a 2x correction.  The DNA sequence is inherited from a common ancestor along each lineage to each modern species that we are comparing.  So the actual distance is twice the time to the common ancestor  \lambda=8\mu t.

inheritance-lineage-2t

So, the probability of a DNA site not mutating between two species is

P(0|\mu ,t) = e^{-8\mu t}

The probability of at least one mutation is:

1-P(0|\mu ,t) = 1-e^{-8\mu t}

Now, in our modified model, if there has been at least one mutation, the probability you end up at a specific state like a “T” is 1/4.  Combining these we get (say we started with an “A”):

P(T|A, \mu ,t) = \frac{1}{4}(1-e^{-8\mu t})

In fact, ending back at an “A” is also:

P(A|A, \mu ,t) = \frac{1}{4}(1-e^{-8\mu t})

The probability that the same site is different in the two different species is:

P(different|\mu ,t) = \frac{3}{4}(1-e^{-8\mu t})

Because, with one species at one state at a site there are three possible ways to be different in the other species, and to do this at least one mutation had to occur between them.

We can see the equilibrium distance from the equation  e raised to a large negative value approaches zero.  1-0=1 and this one is multiplied by \frac{3}{4}.  So at equilibrium the distance between two sequences, that began as identical, is 75%.  In other words, just by chance \frac{1}{4} of the sites will happen to match because there are four nucleotides to choose from.

If we plug in realistic mutation rates, like 10^{-8} we get this kind of curve.

JC-mutation-trajectory

The x-axis major units are 10 million generations (or time units).  The trajectory is near equilibrium at 50 million generations.  Also, the per nucleotide mutation rate is much smaller than the per gene mutation rate where there are many more nucleotide sites that can disrupt the gene.

Ok, so our expected distance (d), the fraction of nucleotides that are different, is

d = \frac{3}{4}(1-e^{-8\mu t})

What we really want in species comparisons is a measure that is linear with time.  Let’s set D=\mu t , which is time linear, substitute it in and solve.

D= - \frac{1}{8} \ln (1- \frac{4}{3} d)

This takes the raw distance (blue curve below) and converts it (assuming the mutation model is a reasonable approximation) into a time linear distance between species (red line below).

JC-linear

If you look up the Jukes-Cantor distance correction in other places you may see different numbers.  This is because there are different ways to scale mutation when you write down the model.

JC-rescale

One approach is to divide all the mutation rates by three (\mu/3), so that the total rate of mutation away from a state is \mu.  This seems reasonable and gives

D= - \frac{3}{8} \ln (1- \frac{4}{3} d)

Another common variation is to ignore the 2x correction for two lineages from a common ancestor and just think of it as a single lineage from a common ancestor, which gives:

D= - \frac{3}{4} \ln (1- \frac{4}{3} d)

This last “3/4,4/3″ version above is the most common way of writing the Jukes-Cantor model correction in the literature.  Of course 1/4 of the estimated total number of mutations are not really mutations as we normally think of them because they result in the same nucleotide state. If I were pressed I guess I would say the “best” estimate, in terms of intuitive definitions of mutations, of the actual number of mutation events that have occurred based on the difference of two sequences is 3/4 of the \mu/3 rates with the 2x time correction:

D= - \frac{3}{4} \times \frac{3}{8} \ln (1- \frac{4}{3} d) = - \frac{9}{32} \ln (1- \frac{4}{3} d)

This is an estimate of events over time, based on our model, that we would actually call mutations–I think. However, in the end it doesn’t really matter how mutation and time are scaled as long as it is consistently applied between comparisons.  What we really want is a distance measure, from the fraction of differences out of the total, that is proportional to the mutation rate and time (the slope doesn’t matter so long as it is linear) rather than to try to directly estimate the actual number of mutations that have occurred over the time period:

D \propto \mu t

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>