Haldane linearisation done right: solving the nonlinear recombination equation the easy way
From MaRDI portal
(Redirected from Publication:727402)
Abstract: 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 degenerate parameter cases. Due to recent progress for the continuous time case via the identification of an underlying stochastic fragmentation process, it became clear that a direct general solution at the level of the corresponding ODE itself should also be possible. This paper shows how to do it, and how to extend the approach to the discrete-time case as well.
Recommendations
- The general recombination equation in continuous time and its solution
- Single-crossover recombination in discrete time
- Solving the migration-recombination equation from a genealogical point of view
- Mutation and recombination with tight linkage
- An Exactly Solved Model for Mutation, Recombination and Selection
Cites work
- scientific article; zbMATH DE number 52904 (Why is no real title available?)
- scientific article; zbMATH DE number 1324227 (Why is no real title available?)
- scientific article; zbMATH DE number 1455131 (Why is no real title available?)
- scientific article; zbMATH DE number 764677 (Why is no real title available?)
- scientific article; zbMATH DE number 3092188 (Why is no real title available?)
- An Exactly Solved Model for Mutation, Recombination and Selection
- Combinatorial theory.
- Convergence of multilocus systems under weak epistasis or weak selection
- Deterministic and stochastic aspects of single-crossover recombination
- Haldane Linearisation of Baric Algebras
- Markov Chains
- On the Probability Theory of Linkage in Mendelian Heredity
- Recombination semigroups on measure spaces
- Single-crossover recombination in discrete time
- The decay of linkage disequilibrium under random union of gametes: How to calculate Bennett's principal components
- The evolution of a population under recombination: how to linearise the dynamics
- The general recombination equation in continuous time and its solution
- The recombination equation for interval partitions
Cited in
(15)- The evolution of a population under recombination: how to linearise the dynamics
- Solving the migration-recombination equation from a genealogical point of view
- Embedding of Markov matrices for \(d \leqslant 4\)
- Labeled partitions in action: recombination, selection, mutation and more
- Nonlinear recombinations and generalized random transpositions
- Single-crossover recombination in discrete time
- Solving the selection-recombination equation: ancestral lines and dual processes
- Selection, recombination, and the ancestral initiation graph
- Mutation and recombination with tight linkage
- Lines of descent in the deterministic mutation-selection model with pairwise interaction
- Asymptotic sampling distributions made easy: loose linkage in the ancestral recombination graph
- Genetic recombination as a generalised gradient flow
- The recombination equation for interval partitions
- Notes on Markov embedding
- Recombination semigroups on measure spaces
This page was built for publication: Haldane linearisation done right: solving the nonlinear recombination equation the easy way
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727402)