We study the asymptotic behaviour of a mutation-selection genetic algorithm
on the integers with finite population, defined by a simple random walk an
d the fitness function f(x) = x. We prove an invariance principle for the n
ormalized population. (C) 2000 Academie des sciences/Editions scientifiques
et medicales Elsevier SAS.