Use of a novel Hill-climbing genetic algorithm in protein folding simulations.
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 chromosome structures that is copied and then mutated. The fitness of the mutated chain's configuration is determined by its radius of gyration. A four-helix bundle was used to optimise simulation conditions, and the program was compared with other, larger, genetic algorithms on a variety of structures. The program ran 50% faster than other GA programs. Overall, tests on 100 non-redundant structures gave comparable results to other genetic algorithms, with the Hill-climbing program running from between 20 and 50% faster. Examples including crambin, cytochrome c, cytochrome B and hemerythrin gave good secondary structure fits with overall alpha carbon atom rms deviations of between 5 and 5.6 A with an optimised hydrophobic term in the fitness function.
Cooper
Lee R
LR
School of Animal and Microbial Sciences, University of Reading, Whiteknights, Reading RG6 6AJ, UK.
Corne
David W
DW
Crabbe
M James C
MJ
D000465:Algorithms; D000595:Amino Acid Sequence; D003198:Computer Simulation; D008957:Models, Genetic; D008958:Models, Molecular; D008969:Molecular Sequence Data; D010940:Plant Proteins / Q000737:chemistry / Q000235:genetics; D017510:Protein Folding; D017433:Protein Structure, Secondary; D017434:Protein Structure, Tertiary; D011506:Proteins / Q000737:chemistry* / Q000235:genetics*
D010940:Plant Proteins; D011506:Proteins; C024934:crambin protein, Crambe abyssinica