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.
D000465:Algorithms; D004252:DNA Mutational Analysis / Q000706:statistics & numerical data*; D005828:Genetics, Population; D006801:Humans; D008390:Markov Chains; D008957:Models, Genetic; D009010:Monte Carlo Method; D011995:Recombination, Genetic / Q000235:genetics*