Molecular Simulation of ab Initio Protein Folding for a Millisecond Folder NTL9(1-39)

Department of Chemistry, Stanford University, Stanford, California 94305, USA.
Journal of the American Chemical Society (Impact Factor: 12.11). 02/2010; 132(5):1526-8. DOI: 10.1021/ja9090353
Source: PubMed


To date, the slowest-folding proteins folded ab initio by all-atom molecular dynamics simulations have had folding times in the range of nanoseconds to microseconds. We report simulations of several folding trajectories of NTL9(1-39), a protein which has a folding time of approximately 1.5 ms. Distributed molecular dynamics simulations in implicit solvent on GPU processors were used to generate ensembles of trajectories out to approximately 40 micros for several temperatures and starting states. At a temperature less than the melting point of the force field, we observe a small number of productive folding events, consistent with predictions from a model of parallel uncoupled two-state simulations. The posterior distribution of the folding rate predicted from the data agrees well with the experimental folding rate (approximately 640/s). Markov State Models (MSMs) built from the data show a gap in the implied time scales indicative of two-state folding and heterogeneous pathways connecting diffuse mesoscopic substates. Structural analysis of the 14 out of 2000 macrostates transited by the top 10 folding pathways reveals that native-like pairing between strands 1 and 2 only occurs for macrostates with p(fold) > 0.5, suggesting beta(12) hairpin formation may be rate-limiting. We believe that using simulation data such as these to seed adaptive resampling simulations will be a promising new method for achieving statistically converged descriptions of folding landscapes at longer time scales than ever before.

Download full-text


Available from: Vincent A Voelz
  • Source
    • "With regard to time, MD simulations have fundamental time scales associated with atomic vibration periods (∼ 10 −13 s), but typical MD time steps are two orders of magnitude smaller. The longest times that have been achieved in large scale MD simulations on special purpose hardware is ∼ 10 −3 s, [30]. More typically MD simulations access times of less than than 10 −8 s. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Diffusive molecular dynamics is a novel model for materials with atomistic resolution that can reach diffusive time scales. The main ideas of diffusive molecular dynamics are to first minimize an approximate variational Gaussian free energy of the system with respect to the mean atomic coordinates (averaging over many vibrational periods), and to then to perform a diffusive step where atoms and vacancies (or two species in a binary alloy) flow on a diffusive time scale via a master equation. We present a mathematical framework for studying this algorithm based upon relative entropy, or Kullback-Leibler divergence. This adds flexibility in how the algorithm is implemented and interpreted. We then compare our formulation, relying on relative entropy and absolute continuity of measures, to existing formulations. The main difference amongst the equations appears in a model for vacancy diffusion, where additional entropic terms appear in our development.
    Preview · Article · Jun 2015
  • Source
    • "However, protein motion simulation has always been a troublesome problem, mostly because of its high demanding computational requirements. Precise simulations based on molecular dynamics are usually limited to small molecules or to the use of supercomputers or distributed networks [1-3]. However, other procedures such as Ab initio or Rosetta methods do not provide information related to protein kinematics. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Background The high demanding computational requirements necessary to carry out protein motion simulations make it difficult to obtain information related to protein motion. On the one hand, molecular dynamics simulation requires huge computational resources to achieve satisfactory motion simulations. On the other hand, less accurate procedures such as interpolation methods, do not generate realistic morphs from the kinematic point of view. Analyzing a protein’s movement is very similar to serial robots; thus, it is possible to treat the protein chain as a serial mechanism composed of rotational degrees of freedom. Recently, based on this hypothesis, new methodologies have arisen, based on mechanism and robot kinematics, to simulate protein motion. Probabilistic roadmap method, which discretizes the protein configurational space against a scoring function, or the kinetostatic compliance method that minimizes the torques that appear in bonds, aim to simulate protein motion with a reduced computational cost. Results In this paper a new viewpoint for protein motion simulation, based on mechanism kinematics is presented. The paper describes a set of methodologies, combining different techniques such as structure normalization normalization processes, simulation algorithms and secondary structure detection procedures. The combination of all these procedures allows to obtain kinematic morphs of proteins achieving a very good computational cost-error rate, while maintaining the biological meaning of the obtained structures and the kinematic viability of the obtained motion. Conclusions The procedure presented in this paper, implements different modules to perform the simulation of the conformational change suffered by a protein when exerting its function. The combination of a main simulation procedure assisted by a secondary structure process, and a side chain orientation strategy, allows to obtain a fast and reliable simulations of protein motion.
    Full-text · Article · Jun 2014 · BMC Bioinformatics
  • Source
    • "Markov state models have been recently used a lot to model molecular dynamics processes, especially in conjunction with large amounts of distributedly simulated trajectory [37] [35] [9] [22] [8] [24]. Applications include conformational rearrangements and folding of peptides, proteins and RNA [9] [25] [6] [24] [40] [23]. In this application area, MSMs have had significant impact because they can be estimated from relatively short simulation trajectories and yet allow the system behavior to be predicted at long timescales. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The slow processes of metastable stochastic dynamical systems are difficult to access by direct numerical simulation due the sampling problem. Here, we suggest an approach for modeling the slow parts of Markov processes by approximating the dominant eigenfunctions and eigenvalues of the propagator. To this end, a variational principle is derived that is based on the maximization of a Rayleigh coefficient. It is shown that this Rayleigh coefficient can be estimated from statistical observables that can be obtained from short distributed simulations starting from different parts of state space. The approach forms a basis for the development of adaptive and efficient computational algorithms for simulating and analyzing metastable Markov processes while avoiding the sampling problem. Since any stochastic process with finite memory can be transformed into a Markov process, the approach is applicable to a wide range of processes relevant for modeling complex real-world phenomena.
    Full-text · Article · Nov 2012 · SIAM Journal on Multiscale Modeling and Simulation
Show more