Sequential Markov coalescent algorithms for population models with demographic structure.
We analyse sequential Markov coalescent algorithms for populations with demographic structure: for a bottleneck model, a population-divergence model, and for a two-island model with migration. The sequential Markov coalescent method is an approximation to the coalescent suggested by McVean and Cardin, and by Marjoram and Wall. Within this algorithm we compute, for two individuals randomly sampled from the population, the correlation between times to the most recent common ancestor and the linkage probability corresponding to two different loci with recombination rate R between them. These quantities characterise the linkage between the two loci in question. We find that the sequential Markov coalescent method approximates the coalescent well in general in models with demographic structure. An exception is the case where individuals are sampled from populations separated by reduced gene flow. In this situation, the correlations may be significantly underestimated. We explain why this is the case.
Department of Physics, University of Gothenburg, SE-41296 Gothenburg, Sweden.
A
A
Eriksson
B
B
Mahjani
B
B
Mehlig
D000465:Algorithms; D003710:Demography; D006801:Humans; D008390:Markov Chains; D008962:Models, Theoretical; D011995:Recombination, Genetic