Related Experiment Video
Updated: Jul 20, 2025

Preparation of the Mgm101 Recombination Protein by MBP-based Tagging Strategy
Published on: June 25, 2013
Recoverability of ancestral recombination graph topologies
Elizabeth Hayman1, Anastasia Ignatieva2, Jotun Hein3
1Department of Mathematics, University of Oxford, Andrew Wiles Building, Oxford OX2 6GG, UK.
Abstract:
Recombination is a powerful evolutionary process that shapes the genetic diversity observed in the populations of many species. Reconstructing genealogies in the presence of recombination from sequencing data is a very challenging problem, as this relies on mutations having occurred on the correct lineages in order to detect the recombination and resolve the ordering of coalescence events in the local trees. We investigate the probability of reconstructing the true topology of ancestral recombination graphs (ARGs) under the coalescent with recombination and gene conversion. We explore how sample size and mutation rate affect the inherent uncertainty in reconstructed ARGs, which sheds light on the theoretical limitations of ARG reconstruction methods. We illustrate our results using estimates of evolutionary rates for several organisms; in particular, we find that for parameter values that are realistic for SARS-CoV-2, the probability of reconstructing genealogies that are close to the truth is low.
Related Concept Videos
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Crossing Over
Overview of Transposition and Recombination
Homologous Recombination
Restarting Stalled Replication Forks
Gene Conversion

