Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by Selrek via the ancestral selection-recombination graph. Here, we introduce a more accessible approach, namely the ancestral initiation graph , in the special case where the fitness of an individual is determined by the leading site . The construction is based on a discretisation of the differential equation. Furthermore, we revisit the dynamics of the linkage equilibria between two neutral loci hitchhiking along with a selected one , and the dependence on the position of the selected site.
Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by Selrek by means of the ancestral selection-recombination graph. Here, we introduce a more accessible approach, namely the ancestral initiation graph . The construction is based on a discretisation of the selection-recombination equation. We apply our method to systematically explain a long-standing observation concerning the dynamics of linkage disequilibrium between two neutral loci hitchhiking along with a selected one . In particular, this clarifies the nontrivial dependence on the position of the selected site.
R
via
by means of
D
, in the special case where the fitness of an individual is determined by the leading site
R
differential equation. Furthermore, we revisit
selection-recombination equation. We apply our method to systematically explain a long-standing observation concerning
R
the linkage equilibria
linkage disequilibrium
R
, and the
. In particular, this clarifies the nontrivial