Asymptotic hitting time for a simple evolutionary model of protein folding

Journal of Applied Probability

Volumn 42, Issue 1, 2005, Pages 39-51

  Ladret, Véronique ^a,b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Evolutionary algorithm; Markov chain; Protein folding

Indexed keywords

EID: 18444402493     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1110381369     Document Type: Article

References (20)

1. ANFINSEN, C. B. (1973). Principles that govern the folding of a protein chain (Nobel lecture). Science 191, 223-230.
2. BÄCK, T. (1993). Optimal mutation rates in genetic search. In Proc. 5th Internat. Conf. Genet. Algorithms, ed. S. Forrest, Morgan Kaufmann, San Fransisco, pp. 2-8.
3. BAKK, A. et al. (2000). Pathways in two-state protein folding. Biophys. J. 79, 2722-2727.
4. BÉRARD, J. AND BIENVENÜE, A. (2000). Convergence of a genetic algorithm with finite population. In Mathematics and Computer Science (Versailles, 2000), Birkhäuser, Basel, pp. 155-163.
5. BÉRARD, J. AND BIENVENÜE, A. (2003). Sharp asymptotic results for simplified mutation-selection algorithms. Ann. Appl. Prob. 13, 1534-1568.
6. BINDER, K. (1987). Applications of the Monte Carlo Method in Statistical Physics. Springer, Berlin.
7. CERF, R. (1996). The dynamics of mutation-selection algorithms with large population sizes. Ann. Inst. H. Poincaré Prob. Statist. 32, 455-508.
8. CERF, R. (1998). Asymptotic convergence of genetic algorithms. Adv. Appl. Prob. 30, 521-550.
9. DEL MORAL, P. AND GUIONNET, A. (2001). On the stability of interacting processes with applications to filtering and genetic algorithms. Ann. Inst. H. Poincaré Prob. Statist. 37, 155-194.
10. DILL, K. A., FEIBIG, K. M. AND CHAN, H. S. (1993). Cooperativity in protein folding kinetics. Proc. Nat. Acad. Sci. USA 90, 1942-1946.
11. DROSTE, S., JANSEN, T. AND WEGENER, I. (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with boolean inputs. In Proc. IEEE Internat. Conf. Evolutionary Comput. (ICEC'98). IEEE Press, Piscataway, NJ, pp. 499-504.
12. DROSTE, S., JANSEN, T. AND WEGENER, I. (2002). On the analysis of the (1 + 1) evolutionary algorithm. Theoret. Comput. Sci. 276, 51-81.
13. GARNIER, J., KALLEL, L. AND SCHOENAUER, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Comput. 7, 173-203.
14. JANSEN, T. AND WEGENER, I. (2001). How to cope wih plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Comput. 5, 589-599.
15. LEVINTHAL, C. (1968). Are there pathways for protein folding? J. Chim. Phys. Phys.-Chim. Biol. 65, 44-45.
16. MAZZA, C. AND PIAU, D. (2001). On the effect of selection in genetic algorithms. Random Structures Algorithms 18, 185-200.
17. MÜHLENBEIN, H. (1992). How genetic algorithms really work: I. Mutation and hill-climbing. In Parallel Problem Solving from Nature PPSN II, eds R. Männer and R. Manderick, North-Holland, Amsterdam, pp. 15-25.
18. RABINOVICH, Y. AND WIGDERSON, A. (1999). Techniques for bounding the convergence rate of genetic algorithms. Random Structures Algorithms 14, 111-138.
19. RUDOLPH, G. (1997). Convergence Properties of Evolutionary Algorithms. Kovac, Hamburg.
20. SCHELLMAN, J. A. (1958). The factors affecting the stability of hydrogen-bounded polypeptide structures in solution. J. Phys. Chem. 62, 1485-1494.