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 rec
ent common ancestors. This paper presents a Markov chain Monte Carlo algori
thm for computing the expected time to the most recent common ancestor alon
g the sequences, conditional on where the mutations occur on the sequences.
(C) 1999 Academic Press.