Biology subjects

Bisschop, G.

Publications and source records attributed to Bisschop, G..

8 recordsLinked to original sources

bioRxiv2026

Tuning the SMC: efficient simulation and the structure of ARGs

Sequentially Markovian Coalescent (SMC) models are a central element of contemporary population genetics, underlying many inferential methods. While the SMC has been shown to closely approximate the canonical Coalescent with Recombination (CwR) in terms of low-dimensional, two-locus summaries, its effects on the deeper structural properties of Ancestral Recombination Graphs (ARGs) are less well understood. Here, we define a general SMC approximation, SMC(k), in which a single parameter k controls the physical scale over which common-ancestor events between non-overlapping ancestral segments are permitted. The model encompasses the standard SMC and SMC' as special cases and converges to the CwR as k increases, providing a tunable trade-off between computational efficiency and fidelity to the full recombination process. Using recently developed summaries of ARG structure, we show that SMC approximations systematically truncate the persistence of ancestral haplotypes across the genome, despite preserving marginal coalescent properties, and that increasing k progressively recovers this long-range ancestral structure. We implement the SMC(k) in msprime and show that, for small samples, it makes whole-chromosome simulation in species with large population-scaled recombination rates several orders of magnitude faster than the CwR. Finally, we use SMC simulations for chromosome-scale parametric bootstrapping of demographic inference and find that the SMC' captures uncertainty in SFS-based estimates remarkably well, with only modest changes as k increases despite substantial differences in long-range ARG structure. Thus, the importance of SMC approximation error depends strongly on which properties of ancestry are relevant to the downstream analysis.

genomics↗

bioRxiv2025

Likelihoods for a general class of ARGs under the SMC

Ancestral recombination graphs (ARGs) are the focus of much ongoing research interest. Recent progress in inference has made ARG-based approaches feasible across of range of applications, and many new methods using inferred ARGs as input have appeared. This progress on the long-standing problem of ARG inference has proceeded in two distinct directions. First, the Bayesian inference of ARGs under the Sequentially Markov Coalescent (SMC), is now practical for tens-to-hundreds of samples. Second, approximate models and heuristics can now scale to sample sizes two to three orders of magnitude larger. Although these heuristic methods are reasonably accurate under many metrics, one significant drawback is that the ARGs they estimate do not have the topological properties required to compute a likelihood under models such as the SMC under present-day formulations. In particular, heuristic inference methods typically do not estimate precise details about recombination events, which are currently required to compute a likelihood. In this paper we present a backwards-time formulation of the SMC and derive a straightforward definition of the likelihood of a general class of ARG under this model. We show that this formulation does not require precise details of recombination events to be estimated, and is robust to the presence of polytomies. We discuss the possibilities for inference that this opens.

genomics↗

bioRxiv2024

tstrait: a quantitative trait simulator for ancestralrecombination graphs

SummaryAncestral recombination graphs (ARGs) encode the ensemble of correlated genealogical trees arising from recombination in a compact and efficient structure, and are of fundamental importance in population and statistical genetics. Recent breakthroughs have made it possible to simulate and infer ARGs at biobank scale, and there is now intense interest in using ARG-based methods across a broad range of applications, particularly in genome-wide association studies (GWAS). Sophisticated methods exist to simulate ARGs using population genetics models, but there is currently no software to simulate quantitative traits directly from these ARGs. To apply existing quantitative trait simulators users must export genotype data, losing important information about ancestral processes and producing prohibitively large files when applied to the biobank-scale datasets currently of interest in GWAS. We present tstrait, an open-source Python library to simulate quantitative traits on ARGs, and show how this user-friendly software can quickly simulate phenotypes for biobank-scale datasets on a laptop computer. Availability and Implementationtstrait is available for download on the Python Package Index. Full documentation with examples and workflow templates is available on https://tskit.dev/tstrait/docs/, and the development version is maintained on GitHub (https://github.com/tskit-dev/tstrait). Contactdaiki.tagami@hertford.ox.ac.uk

bioinformatics↗

bioRxiv2022

Demographically explicit scans for barriers to gene flow using gIMble

Identifying regions of the genome that act as barriers to gene flow between recently diverged taxa has remained challenging given the many evolutionary forces that generate variation in genetic diversity and divergence along the genome, and the stochastic nature of this variation. Progress has been impeded by a conceptual and methodological divide between analyses that infer the demographic history of speciation and genome scans aimed at identifying locally maladaptive alleles i.e. genomic barriers to gene flow. Here we implement genomewide IM blockwise likelihood estimation (gIMble), a composite likelihood approach for the quantification of barriers, that bridges this divide. This analytic framework captures background selection and selection against barriers in a model of isolation with migration (IM) as heterogeneity in effective population size (Ne) and effective migration rate (me), respectively. Variation in both effective demographic parameters is estimated in sliding windows via pre-computed likelihood grids. gIMble includes modules for pre-processing/filtering of genomic data and performing parametric bootstraps using coalescent simulations. To demonstrate the new approach, we analyse data from a well-studied pair of sister species of tropical butterflies with a known history of post-divergence gene flow: Heliconius melpomene and H. cydno. Our analyses uncover both large-effect barrier loci (including well-known wing-pattern genes) and a genome-wide signal of a polygenic barrier architecture. Author summaryAs a fundamental process generating biological diversity, speciation involves the evolution of reproductive isolation and thus the build-up of barriers to genetic exchange among organismal groups. While population genomic data are arguably the only source of information we have about most recent speciation events, the way such data are analysed remains depressingly superficial: population genomic studies of speciation are phrased either as scans for outliers of genetic differentiation, or are based on models of neutral evolution under the constraint of a single genome-wide demography. Here we introduce a new statistical framework called gIMble to estimate the effective rate of gene flow and the effective population sizes along the genome from population genomic data. By capturing genome-wide variation in these two effective demographic parameters, gIMble disentangles the genomic footprints of different modes of selection and provides a direct quantification of the species barrier. To illustrate this framework, we analyse a classic speciation genomic dataset from Heliconius butterflies. We show that barriers to gene flow in this system include both large effect loci - most, but not all, of which were known from functional work - as well as a genome-wide signature of weak-effect polygenic barriers.

evolutionary biology↗

bioRxiv2022

Graph-based algorithms for Laplace transformed coalescence time distributions.

Extracting information on the selective and demographic past of populations that is contained in samples of genome sequences requires a description of the distribution of the underlying genealogies. Using the Laplace transform, this distribution can be generated with a simple recursive procedure, regardless of model complexity. Assuming an infinite-sites mutation model, the probability of observing specific configurations of linked variants within small haplotype blocks can be recovered from the Laplace transform of the joint distribution of branch lengths. However, the repeated differentiation required to compute these probabilities has proven to be a serious computational bottleneck in earlier implementations. Here, I show that the state space diagram can be turned into a computational graph, allowing efficient evaluation of the Laplace transform by means of a graph traversal algorithm. This general algorithm can, for example, be applied to tabulate the likelihoods of mutational configurations in non-recombining blocks. This work provides a crucial speed up for existing composite likelihood approaches that rely on the joint distribution of branch lengths to fit isolation with migration models and estimate the parameters of selective sweeps. The associated software is available as an open-source Python library, agemo.

bioinformatics↗

bioRxiv2021

Efficient ancestry and mutation simulation with msprime 1.0

Stochastic simulation is a key tool in population genetics, since the models involved are often analytically intractable and simulation is usually the only way of obtaining ground-truth data to evaluate inferences. Because of this necessity, a large number of specialised simulation programs have been developed, each filling a particular niche, but with largely overlapping functionality and a substantial duplication of effort. Here, we introduce msprime version 1.0, which efficiently implements ancestry and mutation simulations based on the succinct tree sequence data structure and tskit library. We summarise msprimes many features, and show that its performance is excellent, often many times faster and more memory efficient than specialised alternatives. These high-performance features have been thoroughly tested and validated, and built using a collaborative, open source development model, which reduces duplication of effort and promotes software quality via community engagement.

genetics↗

bioRxiv2021

Sweeps in time: leveraging the joint distribution of branch lengths

Current methods of identifying positively selected regions of the genome are limited by their underlying model in two key ways: the model cannot account for the timing of the adaptive event and the analytic predictions are limited to single nucleotide polymorphisms. Here we develop a tractable method of describing the effect of positive selection on the genealogical histories in the surrounding genome, explicitly modeling both the timing and context of the adaptive event. In addition, our framework allows us to go beyond simple polymorphism data. We are able to leverage information contained in patterns of linked variants, and even with very small sample sizes, our analytic framework has high power to identify historically adaptive regions of the genome and to correctly infer both the time and strength of selection. Finally, we derived the marginal distribution of genealogical branch lengths at a locus affected by selection acting at a linked site. This provides a much-needed link between current theoretical models to recent advances in simulation procedures that have allowed researchers both to examine the evolution of genealogical histories at the level of full chromosomes and build methods that attempt to reconstruct full ancestries from genome sequence data.

evolutionary biology↗

bioRxiv2019

The impact of global selection on local adaptation and reproductive isolation.

Despite the homogenising effect of strong gene flow between two populations, adaptation under symmetric divergent selection pressures results in partial reproductive isolation: adaptive substitutions act as local barriers to gene flow, and if divergent selection continues unimpeded, this will result in complete reproductive isolation of the two populations, i.e. speciation. However, a key issue in framing the process of speciation as a tension between local adaptation and the homogenising force of gene flow is that the mutation process is blind to changes in the environment and therefore tends to limit adaptation. Here we investigate how globally beneficial mutations (GBMs) affect divergent local adaptation and reproductive isolation. When phenotypic divergence is finite, we show that the presence of GBMs limits local adaptation, generating a persistent genetic load at the loci which contribute to the trait under divergent selection and reducing genome-wide divergence. Furthermore, we show that while GBMs cannot prohibit the process of continuous differentiation, they induce a substantial delay in the genome-wide shutdown of gene flow.

evolutionary biology↗