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

Результат исследований: Материалы для книги/типы отчетовМатериалы для конференции

1 цитирование (Scopus)

Выдержка

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.

Язык оригиналаАнглийский
Название основной публикацииArtificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings
ИздательSpringer Verlag
Страницы460-469
Число страниц10
Том4029 LNAI
ISBN (печатное издание)3540357483, 9783540357483
DOI
СостояниеОпубликовано - 2006
Событие8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006 - Zakopane, Польша
Продолжительность: 25 июн 200629 июн 2006

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том4029 LNAI
ISSN (печатное издание)03029743
ISSN (электронное издание)16113349

Конференция

Конференция8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006
СтранаПольша
ГородZakopane
Период25.6.0629.6.06

Отпечаток

Quasispecies
Fitness Function
Strings
Arbitrary
Computer Simulation
Model
Computer simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Цитировать

Red'ko, V. V., & Tsoy, Y. (2006). Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case. В Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings (Том 4029 LNAI, стр. 460-469). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 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. Том 4029 LNAI Springer Verlag, 2006. стр. 460-469 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 4029 LNAI).

Результат исследований: Материалы для книги/типы отчетовМатериалы для конференции

Red'ko, VV & Tsoy, Y 2006, Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case. в Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. том. 4029 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 4029 LNAI, Springer Verlag, стр. 460-469, 8th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2006, Zakopane, Польша, 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. В Artificial Intelligence and Soft Computing - ICAISC 2006 - 8th International Conference, Proceedings. Том 4029 LNAI. Springer Verlag. 2006. стр. 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. Том 4029 LNAI Springer Verlag, 2006. стр. 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 -