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
Protein folding simulation with genetic algorithm and supersecondary structure constraints
β Scribed by Yan Cui; Run Sheng Chen; Wing Hung Wong
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 225 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0887-3585
No coin nor oath required. For personal study only.
β¦ Synopsis
We describe an algorithm to compute native structures of proteins from their primary sequences. The novel aspects of this method are: 1) The hydrophobic potential was set to be proportional to the nonpolar solvent accessible surface. To make computation feasible, we developed a new algorithm to compute the solvent accessible surface areas rapidly. 2) The supersecondary structures of each protein were predicted and used as restraints during the conformation searching processes. This algorithm was applied to five proteins. The overall fold of these proteins can be computed from their sequences, with deviations from crystal structures of 1.48-4.48 Γ for C β£ atoms. Proteins 31:247-257, 1998.
π SIMILAR VOLUMES
In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal