Recombination as a point process along sequences.
Histories of sequences in the coalescent model with recombination can be simulated using an algorithm that takes as input a sample of extant sequences. The algorithm traces the history of the sequences going back in time, encountering recombinations and coalescence (duplications) until the ancestral material is located on one sequence for homologous positions in the present sequences. Here an alternative algorithm is formulated not as going back in time and operating on sequences, but by moving spatially along the sequences, updating the history of the sequences as recombination points are encountered. This algorithm focuses on spatial aspects of the coalescent with recombination rather than on temporal aspects as is the case of familiar algorithms. Mathematical results related to spatial aspects of the coalescent with recombination are derived.
Wiuf
C
C
Institute of Biological Sciences, University of Aarhus, Aarhus, DK-8000, Denmark.
Hein
J
J
D000465:Algorithms; D001483:Base Sequence / Q000235:genetics*; D005828:Genetics, Population; D006801:Humans; D008957:Models, Genetic; D010375:Pedigree; D010802:Phylogeny; D011156:Population Density; D011995:Recombination, Genetic / Q000235:genetics*; D015203:Reproducibility of Results; D016415:Sequence Alignment; D013997:Time Factors