Asymptotic hitting time for a simple evolutionary model of protein folding
| dc.creator | Ladret, Veronique | |
| dc.date | 2003-08-25 | |
| dc.date.accessioned | 2026-07-07T09:45:56Z | |
| dc.date.available | 2026-07-07T09:45:56Z | |
| dc.description | We consider two versions of a simple evolutionary algorithm model for protein folding at temperature zero: the (1+1)-EA on the LeadingOnes problem. In this schematic model, the structure of the protein, which is encoded as a bit-string of length n, is evolved to its native conformation through a stochastic pathway of sequential contact bindings. We study the asymptotic behavior of the hitting time, in the mean case scenario, under two different mutations: the one flip which flips a unique bit chosen uniformly at random in the bit-string, and the Bernoulli flip which flips each bit in the bit-string independently with probability c/n. For each algorithm we prove a law of large numbers, a central limit theorem and compare the performance of the two models. | |
| dc.identifier | https://arxiv.org/abs/math/0308237 | |
| dc.identifier | http://arxiv.org/abs/math/0308237 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163364 | |
| dc.subject | Probability | |
| dc.subject | Biomolecules | |
| dc.subject | 60J10, 60F05, 92D20, 92C05 | |
| dc.title | Asymptotic hitting time for a simple evolutionary model of protein folding | |
| dc.type | text |