Levinthal's paradox.

Laboratory of Chemical Physics, National Institute of Diabetes and Digestive and Kidney Diseases, National Institutes of Health, Bethesda, MD 20892.
Proceedings of the National Academy of Sciences (Impact Factor: 9.81). 02/1992; 89(1):20-2. DOI: 10.1073/pnas.89.1.20
Source: PubMed

ABSTRACT Levinthal's paradox is that finding the native folded state of a protein by a random search among all possible configurations can take an enormously long time. Yet proteins can fold in seconds or less. Mathematical analysis of a simple model shows that a small and physically reasonable energy bias against locally unfavorable configurations, of the order of a few kT, can reduce Levinthal's time to a biologically significant size.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: How do proteins fold, and why do they fold in that way? This Perspective integrates earlier and more recent advances over the 50-y history of the protein folding problem, emphasizing unambiguously clear structural information. Experimental results show that, contrary to prior belief, proteins are multistate rather than two-state objects. They are composed of separately cooperative foldon building blocks that can be seen to repeatedly unfold and refold as units even under native conditions. Similarly, foldons are lost as units when proteins are destabilized to produce partially unfolded equilibrium molten globules. In kinetic folding, the inherently cooperative nature of foldons predisposes the thermally driven amino acid-level search to form an initial foldon and subsequent foldons in later assisted searches. The small size of foldon units, ∼20 residues, resolves the Levinthal time-scale search problem. These microscopic-level search processes can be identified with the disordered multitrack search envisioned in the "new view" model for protein folding. Emergent macroscopic foldon-foldon interactions then collectively provide the structural guidance and free energy bias for the ordered addition of foldons in a stepwise pathway that sequentially builds the native protein. These conclusions reconcile the seemingly opposed new view and defined pathway models; the two models account for different stages of the protein folding process. Additionally, these observations answer the "how" and the "why" questions. The protein folding pathway depends on the same foldon units and foldon-foldon interactions that construct the native structure.
    Proceedings of the National Academy of Sciences 10/2014; 111(45). DOI:10.1073/pnas.1411798111 · 9.81 Impact Factor
  • Accounts of Chemical Research 04/1994; 27(4):94-100. DOI:10.1021/ar00040a002 · 24.35 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A long standing problem in structural bioinformatics is to determine the three-dimensional (3-D) structure of a protein when only a sequence of amino acid residues is given. Many computational methodologies and algorithms have been proposed as a solution to the 3-D Protein Structure Prediction (3-D-PSP) problem. These methods can be divided in four main classes: (a) first principle methods without database information; (b) first principle methods with database information; (c) fold recognition and threading methods; and (d) comparative modeling methods and sequence alignment strategies. Deterministic computational techniques, optimization techniques, data mining and machine learning approaches are typically used in the construction of computational solutions for the PSP problem. Our main goal with this work is to review the methods and computational strategies that are currently used in 3-D protein prediction. Copyright © 2014 Elsevier Ltd. All rights reserved.
    Computational Biology and Chemistry 10/2014; 53. DOI:10.1016/j.compbiolchem.2014.10.001 · 1.60 Impact Factor


1 Download
Available from