Brownian dynamics simulations of protein folding: Access to milliseconds time scale and beyond
- †Department of Chemical Engineering, University of Wisconsin–Madison, Madison, WI 53706; and §Departments of Molecular and Integrative Physiology and Chemical Engineering, Center for Biophysics and Computational Biology, Beckman Institute for Advanced Science and Technology, and National Center for Supercomputing Applications, University of Illinois at Urbana–Champaign, Champaign, IL 61801
-
Communicated by Edwin N. Lightfoot, Jr., University of Wisconsin–Madison, Madison, WI (received for review July 21, 1997)
Abstract
Protein folding occurs on a time scale ranging from milliseconds to minutes for a majority of proteins. Computer simulation of protein folding, from a random configuration to the native structure, is nontrivial owing to the large disparity between the simulation and folding time scales. As an effort to overcome this limitation, simple models with idealized protein subdomains, e.g., the diffusion–collision model of Karplus and Weaver, have gained some popularity. We present here new results for the folding of a four-helix bundle within the framework of the diffusion–collision model. Even with such simplifying assumptions, a direct application of standard Brownian dynamics methods would consume 10,000 processor-years on current supercomputers. We circumvent this difficulty by invoking a special Brownian dynamics simulation. The method features the calculation of the mean passage time of an event from the flux overpopulation method and the sampling of events that lead to productive collisions even if their probability is extremely small (because of large free-energy barriers that separate them from the higher probability events). Using these developments, we demonstrate that a coarse-grained model of the four-helix bundle can be simulated in several days on current supercomputers. Furthermore, such simulations yield folding times that are in the range of time scales observed in experiments.
Footnotes
-
↵ ‡ To whom reprint requests should be addressed at the present address: Scientific Information Resources, Parke–Davis Pharmaceutical Research, 2800 Plymouth Road, Ann Arbor, MI 48105. e-mail: kim01{at}aa.WL.com.
-
↵ § The implementation of the combine–split algorithm in the present work allocates the same quota of particles to each bin and in this respect differs from the original algorithm described in Huber and Kim (5). Having the same number of particles in each bin facilitates data layout on modern parallel supercomputers.
-
↵ ¶ For normally distributed data, the 68.3% confidence interval corresponds exactly to ±1 SD about the average value.
- ABBREVIATION:
- WEB,
- Weighted-Ensemble Brownian
- Copyright © 1998, The National Academy of Sciences





