Surmounting the Multiple-Minima Problem in Protein Folding

Authors:
Harold A. Scheraga;Jooyoung Lee;Jarosław Pillardy;Yuan-Jie Ye;Adam Liwo;Daniel Ripoll
Affiliations:
-;-;-;-;-;-
Venue:
Journal of Global Optimization
Year:
1999

Citing 3
Cited 1

Standard-geometry chains fitted to X-ray derived structures: validation of the Rigid-geometry approximation. I. Chain closure through a limited search of “loop” conformations

Journal of Computational Chemistry
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach

ACM Transactions on Mathematical Software (TOMS)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

A multiple minima genetic algorithm for protein structure prediction

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Protein folding is a very difficult global optimization problem. Furthermore it is coupled with the difficult task of designing a reliable force field with which one has to search for the global minimum. A summary of a series of optimization methods developed and applied to various problems involving polypeptide chains is described in this paper. With recent developments, a computational treatment of the folding of globular proteins of up to 140 residues is shown to be tractable.