2018
DOI: 10.1016/j.mbs.2018.09.001
|View full text |Cite
|
Sign up to set email alerts
|

On the evolution of hypercycles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
21
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(22 citation statements)
references
References 12 publications
1
21
0
Order By: Relevance
“…Note that an equivalent statement holds for the Crow-Kimura setting of the system (6). We provide the discussing for the Theorem 2.1 in terms of system (3) , however, implying the same proof takes place for (6).…”
Section: Open Crow-kimura System With Competitionmentioning
confidence: 75%
See 2 more Smart Citations
“…Note that an equivalent statement holds for the Crow-Kimura setting of the system (6). We provide the discussing for the Theorem 2.1 in terms of system (3) , however, implying the same proof takes place for (6).…”
Section: Open Crow-kimura System With Competitionmentioning
confidence: 75%
“…2.2 Similar derivations are valid for the Crow-Kimura model setting (6). Instead of the system (9), in this case we have the following:…”
Section: Open Crow-kimura System With Competitionmentioning
confidence: 82%
See 1 more Smart Citation
“…However, for practical applications, it is reasonable to consider the impact of changing environment and, thus, dynamical fitness landscapes. There are several ways to include these variations in the fitness landscape, e.g., considering random evolutionary parameters [2,3] or some optimization process over these parameters [4,5] In this paper, we discuss the underlying concept of the recent studies [4,5], which propose a new method of fitness landscape adaptation and describe it in the form of the optimization problem. One of the first researchers, who suggested using the extreme principle for Darwinian evolution, was R. Fisher.…”
Section: Replicator Systemsmentioning
confidence: 99%
“…, h m h      A and calculating a new equilibrium ˆ() th  u at each step, we reduce the maximization problem to a sequence of linear programming problems (detailed analysis is presented in [4]).…”
Section:    mentioning
confidence: 99%