The time to the ancestor along sequences with recombination

Theor Popul Biol. 1999 Apr;55(2):137-44. doi: 10.1006/tpbi.1998.1390.

Abstract

In a sample of DNA sequences where recombination can occur to the ancestors of the sample, distinct parts of the sequences may have different most recent common ancestors. This paper presents a Markov chain Monte Carlo algorithm for computing the expected time to the most recent common ancestor along the sequences, conditional on where the mutations occur on the sequences.

MeSH terms

  • Algorithms
  • DNA Mutational Analysis / statistics & numerical data*
  • Genetics, Population*
  • Humans
  • Markov Chains
  • Models, Genetic
  • Monte Carlo Method
  • Recombination, Genetic / genetics*