Extremal Optimization for protein folding simulations on the lattice
β Scribed by Hengyun Lu; Genke Yang
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 590 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper presents a novel guided search strategy Extremal Optimization (EO) with constrained structure for protein folding. In the proposed algorithm, evaluating the fitness of each monomer in an amino-acid sequence is introduced to guide the improvement of the conformation. In addition, a constrained structure is proposed to reduce the complexity of algorithm. We demonstrate that EO can be applied successfully to the protein folding problem. The results show that the algorithm can find the best solutions so far for the listed benchmarks. Within the achieved results, the search converged rapidly and efficiently.
π SIMILAR VOLUMES
Ab-initio folding simulations have been performed on three small proteins using a genetic algorithm-(GA-) based search method which operates on an all atom representation. Simulations were also performed on a number of small peptides expected to be independent folding units. The present genetic algo
## Abstract A threeβdimensional lattice model of protein designed to assimilate lysozyme is introduced. An attractive interaction is assumed to work between preassigned specific pairs of units, when they occupy the nearestβnighbor lattice points. The behavior of this lattice lysozyme is studied by