Lattice models of peptide aggregation: Evaluation of conformational search algorithms
✍ Scribed by Mark T. Oakley; Jonathan M. Garibaldi; Jonathan D. Hirst
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 300 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We present a series of conformational search calculations on the aggregation of short peptide fragments that form fibrils similar to those seen in many protein mis‐folding diseases. The proteins were represented by a face‐centered cubic lattice model with the conformational energies calculated using the Miyazawa–Jernigan potential. The searches were performed using algorithms based on the Metropolis Monte Carlo method, including simulated annealing and replica exchange. We also present the results of searches using the tabu search method, an algorithm that has been used for many optimization problems, but has rarely been used in protein conformational searches. The replica exchange algorithm consistently found more stable structures then the other algorithms, and was particularly effective for the octamers and larger systems. © 2005 Wiley Periodicals, Inc. J Comput Chem 26: 1638–1646, 2005
📜 SIMILAR VOLUMES
A genetic algorithm-driven search method GAP1.0; Genetic . Algorithm Peptide search, version 1.0 has been developed for the computational exploration of peptide conformational space. The suitability of a variety of genetic algorithm operators was evaluated through representative calculations w x Ž .