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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationArtificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings
PublisherSpringer Verlag
Pages460-469
Number of pages10
Volume4029 LNAI
ISBN (Print)3540357483, 9783540357483
DOIs
Publication statusPublished - 2006
Event8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006 - Zakopane, Poland
Duration: 25 Jun 200629 Jun 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4029 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006
CountryPoland
CityZakopane
Period25.6.0629.6.06

Fingerprint

Quasispecies
Fitness Function
Strings
Arbitrary
Computer Simulation
Model
Computer simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Red'ko, V. V., & Tsoy, Y. (2006). Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case. In Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings (Vol. 4029 LNAI, pp. 460-469). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4029 LNAI). Springer Verlag. https://doi.org/10.1007/11785231_49

Estimation of the evolution speed for the quasispecies model : Arbitrary alphabet case. / Red'ko, Vitaly Vladimirovich; Tsoy, Yuri.

Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. Vol. 4029 LNAI Springer Verlag, 2006. p. 460-469 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4029 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Red'ko, VV & Tsoy, Y 2006, Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case. in Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. vol. 4029 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4029 LNAI, Springer Verlag, pp. 460-469, 8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006, Zakopane, Poland, 25.6.06. https://doi.org/10.1007/11785231_49
Red'ko VV, Tsoy Y. Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case. In Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. Vol. 4029 LNAI. Springer Verlag. 2006. p. 460-469. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11785231_49
Red'ko, Vitaly Vladimirovich ; Tsoy, Yuri. / Estimation of the evolution speed for the quasispecies model : Arbitrary alphabet case. Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. Vol. 4029 LNAI Springer Verlag, 2006. pp. 460-469 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6504e2da0fdc4f08b14687af1ad86a38,
title = "Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case",
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.",
author = "Red'ko, {Vitaly Vladimirovich} and Yuri Tsoy",
year = "2006",
doi = "10.1007/11785231_49",
language = "English",
isbn = "3540357483",
volume = "4029 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "460--469",
booktitle = "Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Estimation of the evolution speed for the quasispecies model

T2 - Arbitrary alphabet case

AU - Red'ko, Vitaly Vladimirovich

AU - Tsoy, Yuri

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746218687&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746218687&partnerID=8YFLogxK

U2 - 10.1007/11785231_49

DO - 10.1007/11785231_49

M3 - Conference contribution

AN - SCOPUS:33746218687

SN - 3540357483

SN - 9783540357483

VL - 4029 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 460

EP - 469

BT - Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings

PB - Springer Verlag

ER -