AB-INITIO PROTEIN-FOLDING SIMULATIONS WITH GENETIC ALGORITHMS - SIMULATIONS ON THE COMPLETE SEQUENCE OF SMALL PROTEINS

Citation
Jt. Pedersen et J. Moult, AB-INITIO PROTEIN-FOLDING SIMULATIONS WITH GENETIC ALGORITHMS - SIMULATIONS ON THE COMPLETE SEQUENCE OF SMALL PROTEINS, Proteins, 1997, pp. 179-184
Citations number
20
Categorie Soggetti
Biology,"Genetics & Heredity
Journal title
ISSN journal
08873585
Year of publication
1997
Supplement
1
Pages
179 - 184
Database
ISI
SICI code
0887-3585(1997):<179:APSWGA>2.0.ZU;2-N
Abstract
Ab-initio folding simulations have been performed on three small prote ins using a genetic algorithm- (GA-) based search method which operate s on an all atom representation. Simulations were also performed on a number of small peptides expected to be independent folding units, The present genetic algorithm incorporates the results of developments ma de to the method first tested in CASP1, Additional operators have been introduced into the search in order to allow the simulation of longer sequences and to avoid premature free energy convergence, Secondary s tructure information derived from a consensus of eight methods and Mon te Carlo simulations on sets of homologous sequences has been used to bias the starting populations used in the GA simulations, For the frag ment simulations, the results generally have approximately correct loc al structure, but tend to be too compact, leading to poor RMS error va lues, One of the three small protein structures has the topology and m ost of the general organization correct, although many of the details are incorrect. (C) 1998 Wiley-Liss, Inc.