Format

Send to

Choose Destination
Theor Popul Biol. 1999 Apr;55(2):137-44.

The time to the ancestor along sequences with recombination.

Author information

1
Mathematics Department, Monash University, Clayton, 3168, Australia. rcg@mathgene.maths.monash.edu.au

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.

PMID:
10329513
DOI:
10.1006/tpbi.1998.1390
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for Elsevier Science
Loading ...
Support Center