Recoverability of Ancestral Recombination Graph Topologies
Recoverability of Ancestral Recombination Graph Topologies
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.
Hayman Elizabeth、Ignatieva Anastasia、Hein Jotun
Department of Mathematics, University of Oxford, Andrew Wiles BuildingDepartment of Statistics, University of Warwick||Department of Statistics, University of OxfordDepartment of Statistics, University of Oxford||The Alan Turing Institute, British Library
遗传学
Recombination detectionancestral recombination graphcoalescentgene conversion
Hayman Elizabeth,Ignatieva Anastasia,Hein Jotun.Recoverability of Ancestral Recombination Graph Topologies[EB/OL].(2025-03-28)[2025-08-02].https://www.biorxiv.org/content/10.1101/2021.10.10.463724.点此复制
评论