Related papers: Solving the selection-recombination equation: Ance…
We consider the discrete-time migration-recombination equation, a deterministic, nonlinear dynamical system that describes the evolution of the genetic type distribution of a population evolving under migration and recombination in a law of…
Solving the recombination equation has been a long-standing challenge of \emph{deterministic} population genetics. We review recent progress obtained by introducing ancestral processes, as traditionally used in the context of…
We reconsider the deterministic haploid mutation-selection equation with two types. This is an ordinary differential equation that describes the type distribution (forward in time) in a population of infinite size. This paper establishes…
This contribution is concerned with mathematical models for the dynamics of the genetic composition of populations evolving under recombination. Recombination is the genetic mechanism by which two parent individuals create the mixed type of…
We study the continuous-time evolution of the recombination equation of population genetics. This evolution is given by a differential equation that acts on a product probability space, and its solution can be described by a Markov chain on…
In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the…
Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by means of the ancestral selection-recombination graph. Here, we introduce a more accessible approach, namely…
We consider the evolution of populations under the joint action of mutation and differential reproduction, or selection. The population is modelled as a finite-type Markov branching process in continuous time, and the associated…
We study a continuous-time dynamical system that models the evolving distribution of genotypes in an infinite population where genomes may have infinitely many or even a continuum of loci, mutations accumulate along lineages without…
We consider the mutation--selection differential equation with pairwise interaction (or, equivalently, the diploid mutation--selection equation) and establish the corresponding ancestral process, which is a random tree and a variant of the…
We give a closed form of the discrete-time evolution of a recombination transformation in population genetics. This decomposition allows to define a Markov chain in a natural way. We describe the geometric decay rate to the limit…
A probability model is presented for the dynamics of mutation-selection balance in a haploid infinite-population infinite-sites setting sufficiently general to cover mutation-driven changes in full age-specific demographic schedules. The…
We consider the Wright-Fisher model for a population of $N$ individuals, each identified with a sequence of a finite number of sites, and single-crossover recombination between them. We trace back the ancestry of single individuals from the…
A steady influx of a single deleterious multilocus genotype will impose genetic load on the resident population and leave multiple descendants carrying various numbers of the foreign alleles. Provided that the foreign types are rare at…
Populations evolving under the joint influence of recombination and resampling (traditionally known as genetic drift) are investigated. First, we summarise and adapt a deterministic approach, as valid for infinite populations, which assumes…
We review models of biological evolution in which the population frequency changes deterministically with time. If the population is self-replicating, although the equations for simple prototypes can be linearised, nonlinear equations arise…
We survey results on the description of stochastically evolving genealogies of populations and marked genealogies of multitype populations or spatial populations via tree-valued Markov processes on (marked) ultrametric measure spaces. In…
The nonlinear recombination equation from population genetics has a long history and is notoriously difficult to solve, both in continuous and in discrete time. This is particularly so if one aims at full generality, thus also including…
In this paper we present a novel tool to evaluate problem solving systems. Instead of using a system to solve a problem, we suggest using the problem to evaluate the system. By finding a numerical representation of a problem's complexity,…
We propose a Markov chain approach for the evolution of a genealogical line of genomes. Our idealized genome has $N$ sites and each site can be in state $0$ or $1$. At each time step we pick a site at random. If the site is in state $0$ we…