Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding

DOI10.1239/jap/1110381369zbMath1074.60076arXivmath/0308237OpenAlexW2137885439MaRDI QIDQ5312839

Véronique Ladret

Publication date: 25 August 2005

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0308237

zbMATH Keywords

Markov chainevolutionary algorithm

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Protein sequences, DNA sequences (92D20) Biophysics (92C05)

Related Items

The impact of random initialization on the runtime of randomized search heuristics, Analyzing randomized search heuristics via stochastic domination, Solving problems with unknown solution length at almost no extra cost, The \((1+1)\) elitist black-box complexity of LeadingOnes, Runtime analysis of ant colony optimization with best-so-far reinforcement

Cites Work

• Sharp asymptotic results for simplified mutation-selection algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• The dynamics of mutation-selection algorithms with large population sizes
• Asymptotic convergence of genetic algorithms
• Techniques for bounding the convergence rate of genetic algorithms
• On the stability of interacting processes with applications to filtering and genetic algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item