Skip to main content
Protein Science : A Publication of the Protein Society logoLink to Protein Science : A Publication of the Protein Society
. 1996 Sep;5(9):1800–1815. doi: 10.1002/pro.5560050906

Improved genetic algorithm for the protein folding problem by use of a Cartesian combination operator.

A A Rabow 1, H A Scheraga 1
PMCID: PMC2143543  PMID: 8880904

Abstract

We have devised a Cartesian combination operator and coding scheme for improving the performance of genetic algorithms applied to the protein folding problem. The genetic coding consists of the C alpha Cartesian coordinates of the protein chain. The recombination of the genes of the parents is accomplished by: (1) a rigid superposition of one parent chain on the other, to make the relation of Cartesian coordinates meaningful, then, (2) the chains of the children are formed through a linear combination of the coordinates of their parents. The children produced with this Cartesian combination operator scheme have similar topology and retain the long-range contacts of their parents. The new scheme is significantly more efficient than the standard genetic algorithm methods for locating low-energy conformations of proteins. The considerable superiority of genetic algorithms over Monte Carlo optimization methods is also demonstrated. We have also devised a new dynamic programming lattice fitting procedure for use with the Cartesian combination operator method. The procedure finds excellent fits of real-space chains to the lattice while satisfying bond-length, bond-angle, and overlap constraints.

Full Text

The Full Text of this article is available as a PDF (4.1 MB).

Selected References

These references are in PubMed. This may not be the complete list of references from this article.

  1. Dandekar T., Argos P. Folding the main chain of small proteins with the genetic algorithm. J Mol Biol. 1994 Feb 25;236(3):844–861. doi: 10.1006/jmbi.1994.1193. [DOI] [PubMed] [Google Scholar]
  2. Kolinski A., Skolnick J. Monte Carlo simulations of protein folding. I. Lattice model and interaction scheme. Proteins. 1994 Apr;18(4):338–352. doi: 10.1002/prot.340180405. [DOI] [PubMed] [Google Scholar]
  3. Nishikawa K., Ooi T. Radial locations of amino acid residues in a globular protein: correlation with the sequence. J Biochem. 1986 Oct;100(4):1043–1047. doi: 10.1093/oxfordjournals.jbchem.a121783. [DOI] [PubMed] [Google Scholar]
  4. Pedersen J. T., Moult J. Ab initio structure prediction for small polypeptides and protein fragments using genetic algorithms. Proteins. 1995 Nov;23(3):454–460. doi: 10.1002/prot.340230319. [DOI] [PubMed] [Google Scholar]
  5. Rykunov D. S., Reva B. A., Finkelstein A. V. Accurate general method for lattice approximation of three-dimensional structure of a chain molecule. Proteins. 1995 Jun;22(2):100–109. doi: 10.1002/prot.340220203. [DOI] [PubMed] [Google Scholar]
  6. Sun S. Reduced representation model of protein structure prediction: statistical potential and genetic algorithms. Protein Sci. 1993 May;2(5):762–785. doi: 10.1002/pro.5560020508. [DOI] [PMC free article] [PubMed] [Google Scholar]
  7. Sun S., Thomas P. D., Dill K. A. A simple protein folding algorithm using a binary code and secondary structure constraints. Protein Eng. 1995 Aug;8(8):769–778. doi: 10.1093/protein/8.8.769. [DOI] [PubMed] [Google Scholar]

Articles from Protein Science : A Publication of the Protein Society are provided here courtesy of The Protein Society

RESOURCES