Skip to main content

Scaling laws for protein folding

  • Conference paper
  • First Online:
Statistical Mechanics of Biocomplexity

Part of the book series: Lecture Notes in Physics ((LNP,volume 527))

  • 516 Accesses

Abstract

We investigated the scaling behaviour of stochastic optimization methods for a simple model potential energy surface (PES) with a perfect funnel structure that reflects key characteristics of the protein interactions. Generalized Monte-Carlo (MCM) and simulated-annealing methods (STUN) avoid an enumerative search of the exponentially complex PES in favor of power-law scaling of the computational effort, thus providing a natural resolution of the Levinthal paradox. We find that the computational effort grows with approximately the eighth power of the system size for MCM and STUN, while a genetic algorithm was found to scale exponentially. The scaling behaviour of a derived lattice model is also rationalized.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

Download references

Author information

Authors and Affiliations

Authors

Editor information

D. Reguera J.M.G. Vilar J.M. Rubí

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Wenzel, W., Hamacher, K. (1999). Scaling laws for protein folding. In: Reguera, D., Vilar, J., Rubí, J. (eds) Statistical Mechanics of Biocomplexity. Lecture Notes in Physics, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105008

Download citation

  • DOI: https://doi.org/10.1007/BFb0105008

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66245-7

  • Online ISBN: 978-3-540-48486-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics