Skip to main content
SpringerLink
Log in
Book cover

The Protein Folding Problem and Tertiary Structure Prediction pp 109–124Cite as

The Genetic Algorithm and Protein Tertiary Structure Prediction

  • Chapter

Abstract

In 1959, Anfinsen demonstrated that the primary structure (the sequence of amino acids) of a protein can uniquely determine its tertiary structure (three dimensional conformation). This implied that there must be a consistent set of rules for deriving a protein’s tertiary structure from its primary structure. The search for these rules is known as the protein folding problem. Despite many creative attempts, these rules have not been determined (Fasman, 1989). Currently, the primary structures of approximately 40,000 proteins are known. However, only a small percentage of those proteins have known, tertiary structures. A solution to the protein folding problem will make 40,000 more tertiary structures available for immediate study by translating the DNA sequence information in the sequence databases into three-dimensional protein structures. This translation will be indispensable for the analysis of results from the Human Genome Project, de novo protein design, and many other areas of biotechnological research. Finally, an in-depth study of the rules of protein folding should provide vital clues to the protein folding process. The search for these rules is therefore an important objective for theoretical molecular biology.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Anet F (1990): Inflection points and chaotic behavior in searching the conformational space of cyclononane. J Am Chem Soc 112:7172–7178

    Article  CAS  Google Scholar 

  • Anfinsen C (1959): The Molecular Basis of Evolution. New York: John Wiley & Sons

    Google Scholar 

  • Booker L (1987): Improving search in genetic algorithms. In Genetic Algorithms and Simulated Annealing. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Bowie J, Eisenberg D (1991): An evolutionary approach to folding proteins from sequence information: application to small α-helical proteins. (Unpublished results.)

    Google Scholar 

  • Bowie J, Lüthy R, Eisenberg D (1991): A method to identify protein sequences that fold into a known three-dimensional structure. Science 253:164–170

    Article  PubMed  CAS  Google Scholar 

  • Brooks B, Bruccoleri R, Olafson B, States D, Swaminathan S, Karplus M (1983): CHARMM: A program for macromolecular energy, minimization, and dynamics calculations. J Comp Chem 4:187–217

    Article  CAS  Google Scholar 

  • Cleveland G, Smith S (1989): Using genetic algorithms to schedule flow shop releases. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Covell DG, Jernigan RL (1990): Conformations of folded proteins in restricted spaces. Biochemistry 29:3287–3294

    Article  PubMed  CAS  Google Scholar 

  • Crippen G (1991): Prediction of protein folding from amino acid sequence over discrete conformational spaces. Biochemistry 30:4232–4237

    Article  PubMed  CAS  Google Scholar 

  • Dandekar T, Argos P (1992): Potential of genetic algorithms in protein folding and protein engineering simulations. Protein Engineering 5:637–645

    Article  PubMed  CAS  Google Scholar 

  • Davidor Y (1989): Analogous crossover. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Fasman G (1989): Development of the prediction of protein structure. In: Prediction of Protein Structure and the Principles of Protein Conformation. New York: Plenum Press

    Chapter  Google Scholar 

  • Fogarty T (1989): Varying the probability of mutation in the genetic algorithm. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Friedrichs MS, Wolynes PG (1989): Genetic algorithms for model bimolecular optimization problems. (Unpublished.)

    Google Scholar 

  • Goldberg D (1989): Genetic Algorithms in Search, Optimization, and Machine Learning. San Mateo, CA: Addison-Wesley

    Google Scholar 

  • Grefenstette J, Baker J (1989): How genetic algorithms work: A critical look at implicit parallelism. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Holland J (1975): Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press

    Google Scholar 

  • Judson RS (1992): Teaching polymers to fold. J Phys Chem 96:10102–10104

    Article  CAS  Google Scholar 

  • Judson RS, Colvin ME, Meza JC, Huffer A, Gutierrez D (1992): Do intelligent configuration search techniques outperform random search for large molecules? Int J Quant Chem 44:277–290

    Article  CAS  Google Scholar 

  • Lau KF, Dill KA (1989): A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22:3986–3997

    Article  CAS  Google Scholar 

  • Lavery R, Sklenar H, Zakrzewska K, Pullman B (1986): The flexibility of nucleic acids: (II) The calculation of internal energy and applications to mono nucleotide DNA. J Biomol Struct Dynam 3:989–1014

    CAS  Google Scholar 

  • Le Grand SM, Merz KM, Jr (1993a): The application of the genetic algorithm to the minimization of potential energy functions. J Global Opt 3:49–66

    Article  Google Scholar 

  • Le Grand SM, Merz KM, Jr (1993b): The application of the genetic algorithm to protein tertiary structure prediction. J Mol Biol (to be submitted)

    Google Scholar 

  • Le Grand SM (1993): Doctoral thesis. The Pennsylvania State University

    Google Scholar 

  • Momany F, McGuire R, Burgess A, Scheraga HA (1975): Energy parameters in Polypeptides. VII. Geometric parameters, partial atomic charges, nonbonded interactions, hydrogen bond interactions, and intrinsic torsional potentials for the naturally occurring amino acids. J Phys Chem 79(22):2361–2381

    Article  CAS  Google Scholar 

  • Montana D, Davis L (1989): Training feedforward neural networks using genetic algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Nemethy G, Scheraga H (1990): Theoretical studies of protein conformation by means of energy computations. FASEB Journal 4(14):3189–3197

    PubMed  CAS  Google Scholar 

  • Ponder JW, Richards FM (1987): Tertiary templates for proteins: Use of packing criteria in the environment of allowed sequences for different structural classes. J Mol Biol 193:775–791

    Article  PubMed  CAS  Google Scholar 

  • Radcliffe N, Wilson G (1990): Natural solutions give their best. New Scientist 126:47–50

    Google Scholar 

  • Schaffer J, Morishima A (1987): An adaptive crossover distribution mechanism for genetic algorithms. In: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum

    Google Scholar 

  • Sippl MJ (1990): Calculation of conformational ensembles from potentials of mean force: an approach to the knowledge-based prediction of local structures in globular proteins. J Mol Biol 213:859–883

    Article  PubMed  CAS  Google Scholar 

  • Sirag D, Weisser P (1987): Toward a unified thermodynamic genetic operator. In: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum

    Google Scholar 

  • Skolnick J, Kolinski A (1990): Simulations of the folding of a globular protein. Science 250:1121–1125

    Article  PubMed  CAS  Google Scholar 

  • Snow ME (1992): Powerful simulated-annealing algorithm locates global minimum of protein-folding potentials from multiple starting conformations. J Comp Chem 13:597–584

    Article  Google Scholar 

  • Sun S (1993): Reduced representation model of protein structure prediction: statistical potential and genetic algorithms. Protein Science 2:762–785

    Article  PubMed  CAS  Google Scholar 

  • Tuffery P, Etchebest C, Hazout S, Lavery R (1991): A new approach to the rapid determination of protein side chain conformations. J Biomol Struct Dynam 8(6): 1267–1289

    Google Scholar 

  • Unger R, Moult J (1993): Genetic algorithms for protein folding simulations. J Mol Biol 231:75–81

    Article  PubMed  CAS  Google Scholar 

  • Vasquez M, Nemethy G, Scheraga HA (1983): Computed conformational states of the 20 naturally occurring amino acid residues and of the prototype residue a-aminobutyric acid. Macromolecules 16:1043–1049

    Article  CAS  Google Scholar 

  • Walbridge C (1989): Genetic algorithms: What computers can learn from Darwin. Technology Review 92:46–53

    Google Scholar 

  • Wayner P (1991): Genetic algorithms. Byte 16(Jan):361–364

    Google Scholar 

  • Weiner S, Kollman P, Nguyen D, Case D (1986): An all atom force field for simulations of proteins and nucleic acids. J Comp Chem 7(2):230–252

    Article  CAS  Google Scholar 

  • Whitley D, Hanson T (1989a): The GENTTOR algorithm and selective pressure: Why rank-based allocation of reproductive trials is best. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Whitley D, Hanson T (1989b): Optimizing neural nets using faster, more accurate genetic search. In: Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann

    Google Scholar 

  • Whitley D, Starkweather T, Bogart C (1990): Genetic algorithms and neural networks: optimizing connections and connectivity. Parallel Computing 14:347–361

    Article  Google Scholar 

  • Whitley D, Starkweather T (1990): GENITORII: A distributed genetic algorithm. J Exp Theor Artif Intell 2:189–214

    Article  Google Scholar 

  • Wilson S, Cui W (1990): Applications of simulated annealing to peptides. Biopolymers 29:225–235

    Article  PubMed  CAS  Google Scholar 

  • Wilson C, Doniach S (1989): A Computer model to dynamically simulate protein folding: studies with crambin. Proteins 6:193–209

    Article  PubMed  CAS  Google Scholar 

Download references

Authors
  1. Scott M. Le Grand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth M. Merz Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, The Pennsylvania State University, 152 Davey Laboratory, University Park, PA, 16802-6300, USA

    Kenneth M. Merz Jr.  & Scott M. Le Grand  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Birkhäuser Boston

About this chapter

Cite this chapter

Le Grand, S.M., Merz, K.M. (1994). The Genetic Algorithm and Protein Tertiary Structure Prediction. In: Merz, K.M., Le Grand, S.M. (eds) The Protein Folding Problem and Tertiary Structure Prediction. Birkhäuser Boston. https://doi.org/10.1007/978-1-4684-6831-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-6831-1_4

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4684-6833-5

  • Online ISBN: 978-1-4684-6831-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation