skip to content

Approximate genealogical inference

Presented by: 
G McVean [Oxford]
Friday 4th April 2008 - 10:00 to 11:00
INI Seminar Room 1

For many inferential problems in evolutionary biology and population genetics considerable power can be gained by explicitly modelling the genealogical relationship between DNA sequences. In the presence of of recombination, genealogical relationships are described by a complex graph. While it is theoretically possible to explore the posterior distribution of such graphs using techniques such as MCMC, in most realistic situations the computational complexity of such methods makes them unpractical. One possible solution is to develop approximations to full genealogical inference. I will discuss what properties such approximations should have and describe one approach that samples local genealogical relationships along a genome.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons