Search

Abstract: Part of understanding a molecule’s conformational dynamics is mapping out the dominant metastable, or long lived, states that it occupies. Once identified, the rates for transitioning between these states may then be determined in order to create a complete model of the system’s conformational dynamics. Here we describe the use of the MSMBuilder package (now available at http://simtk.org/home/msmbuilder/) to build Markov State Models (MSMs) to identify the metastable states from Generalized Ensemble (GE) simulations, as well as other simulation datasets. Besides building MSMs, the code also includes tools for model evaluation and visualization. [Copyright &y& Elsevier]

Locating the minimum free energy paths (MFEPs) between two conformational states is among the most important tasks of biomolecular simulations. For example, knowledge of the MFEP is critical for focusing the effort of unbiased simulations that are used for the construction of Markov state models to the biologically relevant regions of the system. Typically, existing path searching methods perform local sampling around the path nodes in a pre-selected collective variable (CV) space to allow a gradual downhill evolution of the path toward the MFEP. Despite the wide application of such a strategy, the gradual path evolution and the non-trivial a priori choice of CVs are also limiting its overall efficiency and automation. Here we demonstrate that non-local perpendicular sampling can be pursued to accelerate the search, provided that all nodes are reordered thereafter via a traveling-salesman scheme. Moreover, path-CVs can be computed on-the-fly and used as a coordinate system, minimizing the necessary prior knowledge about the system. Our traveling-salesman based automated path searching method achieves a 5-8 times speedup over the string method with swarms-of-trajectories for two peptide systems in vacuum and solution, making it a promising method for obtaining initial pathways when investigating functional conformational changes between a pair of structures. [ABSTRACT FROM AUTHOR]

Markov State Model (MSM) has become a popular approach to study the conformational dynamics of complex biological systems in recent years. Built upon a large number of short molecular dynamics simulation trajectories, MSM is able to predict the long time scale dynamics of complex systems. However, to achieve Markovianity, an MSM often contains hundreds or thousands of states (microstates), hindering human interpretation of the underlying system mechanism. One way to reduce the number of states is to lump kinetically similar states together and thus coarse-grain the microstates into macrostates. In this work, we introduce a probabilistic lumping algorithm, the Gibbs lumping algorithm, to assign a probability to any given kinetic lumping using the Bayesian inference. In our algorithm, the transitions among kinetically distinct macrostates are modeled by Poisson processes, which will well reflect the separation of time scales in the underlying free energy landscape of biomolecules. Furthermore, to facilitate the search for the optimal kinetic lumping (i.e., the lumped model with the highest probability), a Gibbs sampling algorithm is introduced. To demonstrate the power of our new method, we apply it to three systems: a 2D potential, alanine dipeptide, and a WW protein domain. In comparison with six other popular lumping algorithms, we show that our method can persistently produce the lumped macrostate model with the highest probability as well as the largest metastability. We anticipate that our Gibbs lumping algorithm holds great promise to be widely applied to investigate conformational changes in biological macromolecules. [ABSTRACT FROM AUTHOR]

The glutamine binding protein (GlnBP) binds l-glutamine and cooperates with its cognate transporters during glutamine uptake. Crystal structure analysis has revealed an open and a closed conformation for apo- and holo-GlnBP, respectively. However, the detailed conformational dynamics have remained unclear. Herein, we combined NMR spectroscopy, MD simulations, and single-molecule FRET techniques to decipher the conformational dynamics of apo-GlnBP. The NMR residual dipolar couplings of apo-GlnBP were in good agreement with a MD-derived structure ensemble consisting of four metastable states. The open and closed conformations are the two major states. This four-state model was further validated by smFRET experiments and suggests the conformational selection mechanism in ligand recognition of GlnBP. [ABSTRACT FROM AUTHOR]

We implemented a GPU-powered parallel k-centers algorithm to perform clustering on the conformations of molecular dynamics (MD) simulations. The algorithm is up to two orders of magnitude faster than the CPU implementation. We tested our algorithm on four protein MD simulation datasets ranging from the small Alanine Dipeptide to a 370-residue Maltose Binding Protein (MBP). It is capable of grouping 250,000 conformations of the MBP into 4000 clusters within 40 seconds. To achieve this, we effectively parallelized the code on the GPU and utilize the triangle inequality of metric spaces. Furthermore, the algorithm's running time is linear with respect to the number of cluster centers. In addition, we found the triangle inequality to be less effective in higher dimensions and provide a mathematical rationale. Finally, using Alanine Dipeptide as an example, we show a strong correlation between cluster populations resulting from the k-centers algorithm and the underlying density. © 2012 Wiley Periodicals, Inc. [ABSTRACT FROM AUTHOR]

Markov state models (MSMs) have become a popular approach for investigating the conformational dynamics of proteins and other biomolecules. MSMs are typically built from numerous molecular dynamics simulations by dividing the sampled configurations into a large number of microstates based on geometric criteria. The resulting microstate model can then be coarse-grained into a more understandable macrostate model by lumping together rapidly mixing microstates into larger, metastable aggregates. However, finite sampling often results in the creation of many poorly sampled microstates. During coarse-graining, these states are mistakenly identified as being kinetically important because transitions to/from them appear to be slow. In this paper, we propose a formalism based on an algebraic principle for matrix approximation, i.e., the Nyström method, to deal with such poorly sampled microstates. Our scheme builds a hierarchy of microstates from high to low populations and progressively applies spectral clustering on sets of microstates within each level of the hierarchy. It helps spectral clustering identify metastable aggregates with highly populated microstates rather than being distracted by lowly populated states. We demonstrate the ability of this algorithm to discover the major metastable states on two model systems, the alanine dipeptide and trpzip2 peptide. [ABSTRACT FROM AUTHOR]