The Protein Folding Problem and Tertiary Structure Prediction

A solution to the protein folding problem has eluded researchers for more than 30 years. The stakes are high. Such a solution 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 s...

Full description

Bibliographic Details
Other Authors: Merz, Kenneth M.Jr (Editor), LeGrand, Scott M. (Editor)
Format: eBook
Language:English
Published: Boston, MA Birkhäuser 1994, 1994
Edition:1st ed. 1994
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03809nmm a2200349 u 4500
001 EB000629634
003 EBX01000000000000000482716
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781468468311 
100 1 |a Merz, Kenneth M.Jr  |e [editor] 
245 0 0 |a The Protein Folding Problem and Tertiary Structure Prediction  |h Elektronische Ressource  |c edited by Kenneth M.Jr. Merz, Scott M. LeGrand 
250 |a 1st ed. 1994 
260 |a Boston, MA  |b Birkhäuser  |c 1994, 1994 
300 |a 581 p  |b online resource 
505 0 |a 1 Modeling Side Chains in Peptides and Proteins with the Locally Enhanced Sampling/Simulated Annealing Method -- 2 Conformation Searching Using Simulated Annealing -- 3 Multiple-Start Monte Carlo Docking of Flexible Ligands -- 4 The Genetic Algorithm and Protein Tertiary Structure Prediction -- 5 Conformational Search and Protein Folding -- 6 Building Protein Folds Using Distance Geometry: Towards a General Modeling and Prediction Method -- 7 Molecular Dynamics Studies of Protein and Peptide Folding and Unfolding -- 8 Contact Potential for Global Identification of Correct Protein Folding -- 9 Neural Networks for Molecular Sequence Classification -- 10 The “Dead-End Elimination” Theorem: A New Approach to the Side-Chain Packing Problem -- 11 Short Structural Motifs: Definition, Identification, and Applications -- 12 In Search of Protein Folds -- 13 An Adaptive Branch-and-Bound Minimization Method Based on Dynamic Programming -- 14 Computational Complexity, Protein Structure Prediction, and the Levinthal Paradox -- 15 Toward Quantitative Protein Structure Prediction -- 16 The Role of Interior Side-Chain Packing in Protein Folding and Stability -- Keyword Index 
653 |a Medicine / Research 
653 |a Protein Biochemistry 
653 |a Biology / Research 
653 |a Family medicine 
653 |a Biochemistry 
653 |a Biomedical Research 
653 |a Proteins  
653 |a General Practice and Family Medicine 
700 1 |a LeGrand, Scott M.  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
028 5 0 |a 10.1007/978-1-4684-6831-1 
856 4 0 |u https://doi.org/10.1007/978-1-4684-6831-1?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 610.72 
520 |a A solution to the protein folding problem has eluded researchers for more than 30 years. The stakes are high. Such a solution 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 analy­ sis 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 fold­ ing process. The search for these rules is therefore an important objective for theoretical molecular biology. Both experimental and theoretical ap­ proaches have been used in the search for a solution, with many promising results but no general solution. In recent years, there has been an exponen­ tial increase in the power of computers. This has triggered an incredible outburst of theoretical approaches to solving the protein folding problem ranging from molecular dynamics-based studies of proteins in solution to the actual prediction of protein structures from first principles. This volume attempts to present a concise overview of these advances. Adrian Roitberg and Ron Elber describe the locally enhanced sam­ pling/simulated annealing conformational search algorithm (Chapter 1), which is potentially useful for the rapid conformational search of larger molecular systems