Coalescent Gene Genealogies

The coalescent describes the genealogical relations of the lineages ancestral to a sample of genes. The sample size, , may vary from 1 to 50 gene copies; each tree shows a possible genealogy among these copies with nodes representing the common ancestors of the sampled genes. The lengths of branches are randomly based on the probability of coalescence in a population of gene copies.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The coalescent is an algorithmic approach to simulating gene genealogies. It is also a way of looking at the history of genes in a population, which has given rise to considerable theoretical development in population genetics.
The basic idea is that instead of considering the reproduction of genes forward in time, we instead look at the ancestry of a sample of genes looking backward in time. We assume a diploid Wright–Fisher population model. In each generation, two genes have a probability of sharing a single common ancestor, and a probability of having two distinct ancestors. Then the number of generations to have elapsed since their common ancestor is distributed as an exponential decay curve with mean . With sample of size , this Demonstration yields this distribution.
If we extend the sample to gene copies, the expected time in generations until two of these will coalesce is given as
again distributed as a negative exponential. At this time, the algorithm chooses two of the lineages randomly and combines them into a single ancestral lineage. This process iterated across epochs yields a bifurcating tree. The times of the nodes and the total depth of the tree are one instantiation consistent with evolution by genetic drift alone in a finite population.
A fundamental review reference on the coalescent, including the algorithm used here and a C implementation, is
R. R. Hudson, "Gene Genealogies and the Coalescent Process," Oxford Surveys in Evolutionary Biology, 7, 1990 pp. 1–44.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.

Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2018 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+