A fast algorithm for computing multilocus recombination.
A fast algorithm for computing recombination is developed for model organisms with selection on haploids. Haplotype frequencies are transformed to marginal frequencies; random mating and recombination are computed; marginal frequencies are transformed back to haplotype frequencies. With L diallelic loci, this algorithm is theoretically a factor of a constant times (3/8)(L) faster than standard computations with selection on diploids, and up to 16 recombining loci have been computed. This algorithm is then applied to model the opposing evolutionary forces of multilocus epistatic selection and recombination. Selection is assumed to favor haplotypes with specific alleles either all present or all absent. When the number of linked loci exceeds a critical value, a jump bifurcation occurs in the two-dimensional parameter space of the selection coefficient s and the recombination frequency r. The equilibrium solution jumps from high to low mean fitness with increasing r or decreasing s. These numerical results display an unexpected and dramatic nonlinear effect occurring in linkage models with a large number of loci.
Department of Mathematics, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong. jeffrey.chasnov@ust.hk
J R
JR
Chasnov
D000465:Algorithms; D005075:Biological Evolution; D005787:Gene Frequency; D005828:Genetics, Population; D011995:Recombination, Genetic; D012641:Selection, Genetic