Refined Genetic Algorithms for Polypeptide Structure Prediction.
Abstract
Accurate and reliable prediction of macromolecular structures has eluded researchers for nearly 40 years. Prediction via energy minimization assumes the native conformation has the globally minimal energy potential. An exhaustive search is impossible since for molecules of normal size, the size of the search space exceeds the size of the universe. Domain knowledge sources, such as the Brookhaven PDB can be mined for constraints to limit the search space. Genetic algorithms (GAs) are stochastic, population based, search algorithms of polynomial (P) time complexity that can produce semi-optimal solutions for problems of nondeterministic polynomial (NP) time complexity such as PSP. Three three refined GAs are presented: A farming model parallel hybrid GA (PHGA) preserves the effectiveness of the serial algorithm with substantial speed up. Portability across distributed and MPP platforms is accomplished with the Message Passing Interface (MPI) communications standard. A Real-valved GA system, real-valued Genetic Algorithm, Limited by constraints (REGAL), exploiting domain knowledge. Experiments with the pentapeptide Met-enkephalin have identified conformers with lower energies (CHARMM) than the accepted optimal conformer (Scheraga, et al), -31.98 vs -28.96 kcals/mol. Analysis of exogenous parameters yields additional insight into performance. A parallel version (Para-REGAL), an island model modified to allow different active constraints in the distributed subpopulations and novel concepts of Probability of Migration and Probability of Complete Migration.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1996
- Accession Number
- ADA320695
Entities
People
- Charles E. Kaiser Jr
Organizations
- Air Force Institute of Technology