The time to the ancestor along sequences with recombination.

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. Copyright 1999 Academic Press.