Estimation of the evolution speed for the quasispecies model: arbitrary alphabet case

Authors:
Vladimir Red'ko;Yuri Tsoy
Affiliations:
Institute of Optical Neural Technologies, Russian Academy of Sciences, Moscow, Russia;Computer Engineering Department, Tomsk Polytechnic University, Tomsk, Russia
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 5
Cited 1

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.

Verification of pathotyping by quasispecies model

ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficiency of the evolutionary search in M. Eigen's quasispecies model for the case of an arbitrary alphabet (the arbitrary number of possible string symbols) is estimated. Simple analytical formulas for the evolution rate and the total number of fitness function calculations are obtained. Analytical estimations are proved by computer simulations. It is shown that for the case of unimodal fitness function of λ-ary strings of length N, the optimal string can be found during (λ– 1)N generations under condition that the total number of fitness function calculations is of the order of [(λ– 1)N]2.