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 comp
Protein folding simulations with genetic algorithms and a detailed molecular description
โ Scribed by Jan T. Pedersen; John Moult
- Book ID
- 115627913
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 625 KB
- Volume
- 269
- Category
- Article
- ISSN
- 0022-2836
No coin nor oath required. For personal study only.
๐ 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
We have developed a novel Hill-climbing genetic algorithm (GA) for simulation of protein folding. The program (written in C) builds a set of Cartesian points to represent an unfolded polypeptide's backbone. The dihedral angles determining the chain's configuration are stored in an array of chromosom