
(m
ij
). For small m
ij
one may expect behavior similar to that in the case without muta-
tion: the sequences with the high selective value will accumulate, sequences with
low selective value die out. But the existing sequences always produce erroneous se-
quences that are closely related to them and differ only in a small number of muta-
tions. A species and its close relatives that appeared by mutation are referred to as
quasispecies. Therefore, there is not selection of a single master species, but rather
of a set of species. The species with the highest selective value and its close relatives
form the master quasispecies distribution.
In conclusion, the quasispecies model does not predict the ultimate extinction of
all but the fastest replicating sequence. Although the sequences that replicate more
slowly cannot sustain their abundance level by themselves, they are constantly re-
plenished as sequences that replicate faster mutate into them. At equilibrium, re-
moval of slowly replicating sequences due to decay or outflow is balanced by replen-
ishing, so that even relatively slowly replicating sequences can remain present in fi-
nite abundance.
Due to the ongoing production of mutant sequences, selection acts not on single
sequences but rather on so-called mutational clouds of closely related sequences, the
quasispecies. In other words, the evolutionary success of a particular sequence de-
pends not only on its own replication rate but also on the replication rates of the mu-
tant sequences it produces and on the replication rates of the sequences of which it
is a mutant. As a consequence, the sequence that replicates fastest may even disap-
pear completely in selection-mutation equilibrium, in favor of more slowly replicat-
ing sequences that are part of a quasispecies with a higher average growth rate (Swe-
tina and Schuster 1982). Mutational clouds as predicted by the quasispecies model
have been observed in RNA viruses and in in vitro RNA replication (Domingo and
Holland 1997; Burch and Chao 2000).
10.1.1.4 The Genetic Algorithm
The evolution process in the quasispecies concept can also be viewed as a stochastic
algorithm. This can be used as a strategy for a computer search algorithm. The evo-
lution process produces consequent generations. We start with an initial population
S(0) = {S
1
(0), …, S
n
(0)} at time t = 0. A new generation S (t + 1) is obtained from the
old one S(t) by random selection and mutation of sequences S
i
(t), where t corre-
sponds to the generation number. Assume that all f
i
^ 1, which can be ensured by
normalization. The model evolution process can be described formally in the follow-
ing computer program–like manner.
1. Initialization. Form an initial population S(0) = {S
1
(0), …, S
n
(0)} by choosing ran-
domly for every sequence i =1,…,n and for every position k =1,…,N in the se-
quence a symbol from the given alphabet (e.g., A, T, C, G or “0” and “1”).
2. Sequence selection for the new generation. Select sequences by choosing ran-
domly numbers i' with the probability f
i'
and add a copy of the old sequence S
i'
(t)
to the new population as S
i'
(t + 1).
3. Control of population size. Repeat step 2 until the new population has reached
size n of the initial population.
343
10.1 Quasispecies and Hypercycles