A Genetic Algorithm with Conformational Memories for Structure Prediction of Polypeptides

Abstract

We have developed an iterative hybrid algorithm (HA) to predict the 3D structure of peptides starting from their amino acid sequence. The HA is made of a modified genetic algorithm (GA) coupled to a local optimizer. Each HA iteration is carried out in two phases. In the first phase several GA runs are performed upon the entire peptide conformational space. In the second phase we used the manifestation of what we have called conformational memories, that arises at the end of the first phase, as a way of reducing the peptide conformational space in subsequent HA iterations. Use of conformational memories speeds up and refines the localization of the structure at the putative Global Energy Minimum (GEM) since conformational barriers are avoided. The algorithm has been used to predict successfully the putative GEM for Met- and Leu-enkephalin, and to obtain useful information regarding the 3D structure for the 8mer of polyglycine and the 16 residue (AAQAA)₃Y peptide. The number of fitness function evaluations needed to locate the putative GEMs are fewer than those reported for other heuristic methods. This study opens the possibility of using Genetic Algorithms in high level predictions of secondary structure of polypeptides.

Key words:

• Protein structure prediction
• heuristic algorithms
• genetic algorithms
• protein folding
• conformational space search
• conformational memories