Genome-Wide Inference of Ancestral Recombination Graphs

• Published in: PLoS genetics Vol. 10; no. 5; p. e1004342
• Main Authors: Rasmussen, Matthew D., Hubisz, Melissa J., Gronau, Ilan, Siepel, Adam
• Format: Journal Article
• Language: English
• Published: United States Public Library of Science 01.05.2014; Public Library of Science (PLoS)
• Subjects: Algorithms; Biology and Life Sciences; Chromosomes; Colleges & universities; Computer Simulation; Computers; Deoxyribonucleic acid; DNA; DNA sequencing; Evolution; Evolution, Molecular; Experiments; Genealogy; Genetic recombination; Genome, Human; Genome-wide association studies; Genomes; Genomics; Humans; Markov Chains; Models, Genetic; Monte Carlo Method; Nucleotide sequencing; Physical Sciences; Population; Recombination, Genetic; Selection, Genetic - genetics
• ISSN: 1553-7404; 1553-7390; 1553-7404
• DOI: 10.1371/journal.pgen.1004342

The complex correlation structure of a collection of orthologous DNA sequences is uniquely captured by the "ancestral recombination graph" (ARG), a complete record of coalescence and recombination events in the history of the sample. However, existing methods for ARG inference are computationally intensive, highly approximate, or limited to small numbers of sequences, and, as a consequence, explicit ARG inference is rarely used in applied population genomics. Here, we introduce a new algorithm for ARG inference that is efficient enough to apply to dozens of complete mammalian genomes. The key idea of our approach is to sample an ARG of [Formula: see text] chromosomes conditional on an ARG of [Formula: see text] chromosomes, an operation we call "threading." Using techniques based on hidden Markov models, we can perform this threading operation exactly, up to the assumptions of the sequentially Markov coalescent and a discretization of time. An extension allows for threading of subtrees instead of individual sequences. Repeated application of these threading operations results in highly efficient Markov chain Monte Carlo samplers for ARGs. We have implemented these methods in a computer program called ARGweaver. Experiments with simulated data indicate that ARGweaver converges rapidly to the posterior distribution over ARGs and is effective in recovering various features of the ARG for dozens of sequences generated under realistic parameters for human populations. In applications of ARGweaver to 54 human genome sequences from Complete Genomics, we find clear signatures of natural selection, including regions of unusually ancient ancestry associated with balancing selection and reductions in allele age in sites under directional selection. The patterns we observe near protein-coding genes are consistent with a primary influence from background selection rather than hitchhiking, although we cannot rule out a contribution from recurrent selective sweeps.