Back

Coalescent tree recording with selection for fast forward-in-time simulations

Matthey-Doret, R.

2021-12-09 bioinformatics
10.1101/2021.12.06.470918 bioRxiv
Show abstract

Forward simulations are increasingly important in evolutionary genetics to simulate selection with realistic demography, mating systems and ecology. To reach the performance needed for genome-wide simulations a number of new simulation techniques have been developed recently. Kelleher et al. (2018) introduced a technique consisting in recording the entire genetic history of the population and placing mutations on the coalescent tree. This method cannot model selection. I recently introduced a simulation technique that speed up fitness calculation by assuming that fitness effects among haplotypes are multiplicative (Matthey-Doret, 2021). More precisely, fitness measures are stored for subsets of the genome and, at time of reproduction, if no recombination happen within a given subset, then the fitness for this subset for the offspring haplotype is directly inferred from the parental haplotype. Here, I present and benchmark a hybrid of the above two techniques. The algorithm records the genetic history of a species, directly places the mutations on the tree and infers fitness of subsets of the genome from parental haplotypes. At recombinant sites, the algorithm explores the tree to reconstruct the genetic data at the recombining segment. I benchmarked this new technique implemented in SimBit and report an important improvement of performance compared to previous techniques to simulate selection. This improvement is particularly drastic at low recombination rate. Such developments of new simulation techniques are pushing the horizon of the realism with which we can simulate species molecular evolution.

Matching journals

The top 5 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.