A computational view of population genetics

DOI<313::AID-RSA1>3.0.CO;2-W 10.1002/(SICI)1098-2418(199807)12:4<313::AID-RSA1>3.0.CO;2-WzbMath0955.92023OpenAlexW2032053909MaRDI QIDQ4705315

Yuri Rabinovich, Yuval Rabani, Alistair Sinclair

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199807)12:4<313::aid-rsa1>3.0.co;2-w

zbMATH Keywords

rate of convergenceequilibriumgenetic algorithmspopulation geneticsquadratic systemscrossover systemsrandom matings

Mathematics Subject Classification ID

Dynamical systems in biology (37N25) Genetics and epigenetics (92D10)

Related Items (7)

A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs ⋮ Entropy production in nonlinear recombination models ⋮ Techniques for bounding the convergence rate of genetic algorithms ⋮ Toward a unifying framework for evolutionary processes ⋮ How to analyse evolutionary algorithms. ⋮ Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.

This page was built for publication: A computational view of population genetics