publications.bib

@article{doi:10.1021/ja207470h,
author = {Lane, Thomas J. and Bowman, Gregory R. and Beauchamp, Kyle and Voelz, Vincent A. and Pande, Vijay S.},
title = {Markov State Model Reveals Folding and Functional Dynamics in Ultra-Long MD Trajectories},
journal = {J. Am. Chem. Soc.},
volume = {133},
number = {45},
pages = {18413--18419},
year = {2011},
doi = {10.1021/ja207470h},
URL = {http://pubs.acs.org/doi/abs/10.1021/ja207470h},
eprint = {http://pubs.acs.org/doi/pdf/10.1021/ja207470h},
abstract = {Two strategies have been recently employed to push molecular simulation to long, biologically relevant time scales: projection-based analysis of results from specialized hardware producing a small number of ultralong trajectories and the statistical interpretation of massive parallel sampling performed with Markov state models (MSMs). Here, we assess the MSM as an analysis method by constructing a Markov model from ultralong trajectories, specifically two previously reported 100 $\mu$s trajectories of the FiP35 WW domain ( Shaw, D. E. Science 2010, 330, 341-346 ). We find that the MSM approach yields novel insights. It discovers new statistically significant folding pathways, in which either beta-hairpin of the WW domain can form first. The rates of this process approach experimental values in a direct quantitative comparison (time scales of 5.0 $\mu$ s and 100 ns), within a factor of $\sim$2. Finally, the hub-like topology of the MSM and identification of a holo conformation predicts how WW domains may function through a conformational selection mechanism. }
}

@article{41893,
title = {Cloud-based simulations on Google Exacycle reveal ligand modulation of GPCR activation pathways},
author  = {Kai Kohlhoff and Diwakar Shukla and Morgan Lawrenz and Gregory Bowman and David Konerding and Dan Belov and Russ Altman and Vijay Pande},
year  = 2014,
doi = {10.1038/nchem.1821},
journal = {Nat. Chem.},
pages = {15--21},
volume  = {6},
abstract = {Simulations can provide tremendous insight into the atomistic details of biological mechanisms, but micro- to millisecond timescales are historically only accessible on dedicated supercomputers. We demonstrate that cloud computing is a viable alternative that brings long-timescale processes within reach of a broader community. We used Google's Exacycle cloud-computing platform to simulate two milliseconds of dynamics of a major drug target, the G-protein-coupled receptor β2AR. Markov state models aggregate independent simulations into a single statistical model that is validated by previous computational and experimental results. Moreover, our models provide an atomistic description of the activation of a G-protein-coupled receptor and reveal multiple activation pathways. Agonists and inverse agonists interact differentially with these pathways, with profound implications for drug design.}
}

@article{Beauchamp30102012,
author = {Beauchamp, Kyle A. and McGibbon, Robert and Lin, Yu-Shan and Pande, Vijay S.}, 
title = {Simple few-state models reveal hidden complexity in protein folding},
volume = {109}, 
number = {44}, 
pages = {17807--17813}, 
year = {2012}, 
doi = {10.1073/pnas.1201810109}, 
abstract ={Markov state models constructed from molecular dynamics simulations have recently shown success at modeling protein folding kinetics. Here we introduce two methods, flux PCCA+ (FPCCA+) and sliding constraint rate estimation (SCRE), that allow accurate rate models from protein folding simulations. We apply these techniques to fourteen massive simulation datasets generated by Anton and Folding@home. Our protocol quantitatively identifies the suitability of describing each system using two-state kinetics and predicts experimentally detectable deviations from two-state behavior. An analysis of the villin headpiece and FiP35 WW domain detects multiple native substates that are consistent with experimental data. Applying the same protocol to GTT, NTL9, and protein G suggests that some beta containing proteins can form long-lived native-like states with small register shifts. Even the simplest protein systems show folding and functional dynamics involving three or more states.}, 
URL = {http://www.pnas.org/content/109/44/17807.abstract}, 
eprint = {http://www.pnas.org/content/109/44/17807.full.pdf+html}, 
journal = {Proc. Natl. Acad. Sci. U.S.A.}
}


@article{Lin2012315,
title = {Investigating How Peptide Length and a Pathogenic Mutation Modify the Structural Ensemble of Amyloid Beta Monomer },
journal = {Biophys. J.},
volume = {102},
number = {2},
pages = {315--324},
year = {2012},
issn = {0006-3495},
doi = {10.1016/j.bpj.2011.12.002},
URL = {http://www.sciencedirect.com/science/article/pii/S0006349511053653},
author = {Yu-Shan Lin and Gregory R. Bowman and Kyle A. Beauchamp and Vijay S. Pande},
abstract = {The aggregation of amyloid beta (Aβ) peptides plays an important role in the development of Alzheimer's disease. Despite extensive effort, it has been difficult to characterize the secondary and tertiary structure of the Aβ monomer, the starting point for aggregation, due to its hydrophobicity and high aggregation propensity. Here, we employ extensive molecular dynamics simulations with atomistic protein and water models to determine structural ensembles for Aβ42, Aβ40, and Aβ42-E22K (the Italian mutant) monomers in solution. Sampling of a total of >700 microseconds in all-atom detail with explicit solvent enables us to observe the effects of peptide length and a pathogenic mutation on the disordered Aβ monomer structural ensemble. Aβ42 and Aβ40 have crudely similar characteristics but reducing the peptide length from 42 to 40 residues reduces β-hairpin formation near the C-terminus. The pathogenic Italian E22K mutation induces helix formation in the region of residues 20–24. This structural alteration may increase helix-helix interactions between monomers, resulting in altered mechanism and kinetics of Aβ oligomerization.}
}


@article{Bowman17072012,
author = {Bowman, Gregory R. and Geissler, Phillip L.}, 
title = {Equilibrium fluctuations of a single folded protein reveal a multitude of potential cryptic allosteric sites},
volume = {109}, 
number = {29}, 
pages = {11681--11686}, 
year = {2012}, 
doi = {10.1073/pnas.1209309109}, 
abstract ={Cryptic allosteric sites—transient pockets in a folded protein that are invisible to conventional experiments but can alter enzymatic activity via allosteric communication with the active site—are a promising opportunity for facilitating drug design by greatly expanding the repertoire of available drug targets. Unfortunately, identifying these sites is difficult, typically requiring resource-intensive screening of large libraries of small molecules. Here, we demonstrate that Markov state models built from extensive computer simulations (totaling hundreds of microseconds of dynamics) can identify prospective cryptic sites from the equilibrium fluctuations of three medically relevant proteins—β-lactamase, interleukin-2, and RNase H—even in the absence of any ligand. As in previous studies, our methods reveal a surprising variety of conformations—including bound-like configurations—that implies a role for conformational selection in ligand binding. Moreover, our analyses lead to a number of unique insights. First, direct comparison of simulations with and without the ligand reveals that there is still an important role for an induced fit during ligand binding to cryptic sites and suggests new conformations for docking. Second, correlations between amino acid sidechains can convey allosteric signals even in the absence of substantial backbone motions. Most importantly, our extensive sampling reveals a multitude of potential cryptic sites—consisting of transient pockets coupled to the active site—even in a single protein. Based on these observations, we propose that cryptic allosteric sites may be even more ubiquitous than previously thought and that our methods should be a valuable means of guiding the search for such sites.}, 
URL = {http://www.pnas.org/content/109/29/11681.abstract}, 
eprint = {http://www.pnas.org/content/109/29/11681.full.pdf+html}, 
journal = {Proc. Natl. Acad. Sci. U.S.A.}
}

@article{:/content/aip/journal/jcp/137/13/10.1063/1.4755751,
author = {Bowman, Gregory R.},
title = {Improved coarse-graining of Markov state models via explicit consideration of statistical uncertainty},
journal = {J. Chem. Phys.},
year = {2012},
volume = {137},
number = {13},
eid = 134111,
pages = {},
URL = {http://scitation.aip.org/content/aip/journal/jcp/137/13/10.1063/1.4755751},
doi = {10.1063/1.4755751},
abstract = {Markov state models (MSMs)–or discrete-time master equation models–are a powerful way of modeling the structure and function of molecular systems like proteins. Unfortunately, MSMs with sufficiently many states to make a quantitative connection with experiments (often tens of thousands of states even for small systems) are generally too complicated to understand. Here, I present a Bayesian agglomerative clustering engine (BACE) for coarse-graining such Markovmodels, thereby reducing their complexity and making them more comprehensible. An important feature of this algorithm is its ability to explicitly account for statistical uncertainty in model parameters that arises from finite sampling. This advance builds on a number of recent works highlighting the importance of accounting for uncertainty in the analysis of MSMs and provides significant advantages over existing methods for coarse-graining Markov state models. The closed-form expression I derive here for determining which states to merge is equivalent to the generalized Jensen-Shannon divergence, an important measure from information theory that is related to the relative entropy. Therefore, the method has an appealing information theoretic interpretation in terms of minimizing information loss. The bottom-up nature of the algorithm likely makes it particularly well suited for constructing mesoscale models. I also present an extremely efficient expression for Bayesian model comparison that can be used to identify the most meaningful levels of the hierarchy of models from BACE.}
}

@article{doi:10.1021/ja311077u,
author = {Dickson, Alex and Brooks, Charles L.},
title = {Native States of Fast-Folding Proteins Are Kinetic Traps},
journal = {J. Am. Chem. Soc.},
volume = {135},
number = {12},
pages = {4729--4734},
year = {2013},
doi = {10.1021/ja311077u},
URL = {http://pubs.acs.org/doi/abs/10.1021/ja311077u},
eprint = {http://pubs.acs.org/doi/pdf/10.1021/ja311077u},
abstract = {It has been suggested that the native state of a protein acts as a kinetic hub that can facilitate transitions between nonnative states. Using recently developed tools to quantify mediation probabilities (“hub scores”), we quantify hub-like behavior in atomic resolution trajectories for the first time. We use a data set of trajectory ensembles for 12 fast-folding proteins previously published by D. E. Shaw Research (Lindorff-Larsen, K.; et al. How Fast-Folding Proteins Fold. Science2011, 334, 517) with an aggregate simulation time of over 8.2 ms. We visualize the free-energy landscape of each molecule using configuration space networks, and show that dynamic quantities can be qualitatively understood from visual inspection of the networks. Modularity optimization is used to provide a parameter-free means of tessellating the network into a group of communities. Using hub scores, we find that the percentage of trajectories that are mediated by the native state is 31% when averaged over all molecules, and reaches a maximum of 52% for the homeodomain and chignolin. Furthermore, for these mediated transitions, we use Markov models to determine whether the native state acts as a facilitator for the transition, or as a trap (i.e., an off-pathway detour). Although instances of facilitation are found in 4 of the 12 molecules, we conclude that the native state acts primarily as a trap, which is consistent with the idea of a funnel-like landscape. }
}

@article{doi:10.1021/ct300537s,
author = {Dickson, Alex and Brooks, Charles L.},
title = {Quantifying Hub-like Behavior in Protein Folding Networks},
journal = {J. Chem. Theory Comput.},
volume = {8},
number = {9},
pages = {3044--3052},
year = {2012},
doi = {10.1021/ct300537s},
URL = {http://pubs.acs.org/doi/abs/10.1021/ct300537s},
eprint = {http://pubs.acs.org/doi/pdf/10.1021/ct300537s},
abstract = {The free energy landscape of a protein is a function of many interdependent degrees of freedom. For this reason, conceptual constructs (e.g., funnels) have been useful to visualize these landscapes. One relatively new construct is the idea of a hub-like native state that is the final destination of many noninterconverting folding pathways. This is in contrast to the idea of a single predominant folding pathway connecting the native state to a rapidly interconverting ensemble of unfolded states. The key quantity to distinguish between these two ideas is the connectivity of the unfolded ensemble. We present a metric to determine this connectivity for a given network, which can be calculated either from continuous folding trajectories, or a Markov model. The metric determines how often a region of space is used as an intermediate on transition paths that connect two other regions of space, and we use it here to determine how often two parts of the unfolded ensemble are connected directly versus how often these transitions are mediated by the native state. }
}


@article{:/content/aip/journal/jcp/138/17/10.1063/1.4802007,
author = {Yao, Yuan and Cui, Raymond Z. and Bowman, Gregory R. and Silva, Daniel-Adriano and Sun, Jian and Huang, Xuhui},
title = {Hierarchical Nyström methods for constructing Markov state models for conformational dynamics},
journal = {J. Chem. Phys.},
year = {2013},
volume = {138},
number = {17},
eid = 174106,
pages = {},
url = {http://scitation.aip.org/content/aip/journal/jcp/138/17/10.1063/1.4802007},
doi = {10.1063/1.4802007},
abstract = {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.}
}

@article{:/content/aip/journal/jcp/139/12/10.1063/1.4812768,
author = {Bowman, Gregory R. and Meng, Luming and Huang, Xuhui},
title = {Quantitative comparison of alternative methods for coarse-graining biological networks},
journal = {J. Chem. Phys.},
year = {2013},
volume = {139},
number = {12},
eid = 121905,
pages = {},
url = {http://scitation.aip.org/content/aip/journal/jcp/139/12/10.1063/1.4812768},
doi = {10.1063/1.4812768},
abstract = {Markov models and master equations are a powerful means of modeling dynamic processes like protein conformational changes. However, these models are often difficult to understand because of the enormous number of components and connections between them. Therefore, a variety of methods have been developed to facilitate understanding by coarse-graining these complex models. Here, we employ Bayesian model comparison to determine which of these coarse-graining methods provides the models that are most faithful to the original set of states. We find that the Bayesian agglomerative clustering engine and the hierarchical Nyström expansion graph (HNEG) typically provide the best performance. Surprisingly, the original Perron cluster cluster analysis (PCCA) method often provides the next best results, outperforming the newer PCCA+ method and the most probable paths algorithm. We also show that the differences between the models are qualitatively significant, rather than being minor shifts in the boundaries between states. The performance of the methods correlates well with the entropy of the resulting coarse-grainings, suggesting that finding states with more similar populations (i.e., avoiding low population states that may just be noise) gives better results.}
}

@article{doi:10.1021/ct400132h,
author = {McGibbon, Robert T. and Pande, Vijay S.},
title = {Learning Kinetic Distance Metrics for Markov State Models of Protein Conformational Dynamics},
journal = {J. Chem. Theory Comput.},
volume = {9},
number = {7},
pages = {2900--2906},
year = {2013},
doi = {10.1021/ct400132h},
URL = {http://pubs.acs.org/doi/abs/10.1021/ct400132h},
eprint = {http://pubs.acs.org/doi/pdf/10.1021/ct400132h},
abstract = {Statistical modeling of long timescale dynamics with Markov state models (MSMs) has been shown to be an effective strategy for building quantitative and qualitative insight into protein folding processes. Existing methodologies, however, rely on geometric clustering using distance metrics such as root mean square deviation (RMSD), assuming that geometric similarity provides an adequate basis for the kinetic partitioning of phase space. Here, inspired by advances in the machine learning community, we introduce a new approach for learning a distance metric explicitly constructed to model kinetic similarity. This approach enables the construction of models, especially in the regime of high anisotropy in the diffusion constant, with fewer states than was previously possible. Application of this technique to the analysis of two ultralong molecular dynamics simulations of the FiP35 WW domain identifies discrete near-native relaxation dynamics in the millisecond regime that were not resolved in previous analyses. }
}

@article{10.1371/journal.pone.0058699,
author = {Chang, Huang-Wei and Bacallado, Sergio and Pande, Vijay S. and Carlsson, Gunnar E.},
journal = {PLoS ONE},
publisher = {Public Library of Science},
title = {Persistent Topology and Metastable State in Conformational Dynamics},
year = {2013},
month = {04},
volume = {8},
pages = {e58699},
abstract = {The large amount of molecular dynamics simulation data produced by modern computational models brings big opportunities and challenges to researchers. Clustering algorithms play an important role in understanding biomolecular kinetics from the simulation data, especially under the Markov state model framework. However, the ruggedness of the free energy landscape in a biomolecular system makes common clustering algorithms very sensitive to perturbations of the data. Here, we introduce a data-exploratory tool which provides an overview of the clustering structure under different parameters. The proposed Multi-Persistent Clustering analysis combines insights from recent studies on the dynamics of systems with dominant metastable states with the concept of multi-dimensional persistence in computational topology. We propose to explore the clustering structure of the data based on its persistence on scale and density. The analysis provides a systematic way to discover clusters that are robust to perturbations of the data. The dominant states of the system can be chosen with confidence. For the clusters on the borderline, the user can choose to do more simulation or make a decision based on their structural characteristics. Furthermore, our multi-resolution analysis gives users information about the relative potential of the clusters and their hierarchical relationship. The effectiveness of the proposed method is illustrated in three biomolecules: alanine dipeptide, Villin headpiece, and the FiP35 WW domain.},
number = {4},
doi = {10.1371/journal.pone.0058699}
}        

@article{C3CP54336F,
author = {Jimenez-Cruz, Camilo A. and Garcia, Angel E.},
title = {Equilibrium thermodynamics and folding kinetics of a short, fast-folding, beta-hairpin},
journal = {Phys. Chem. Chem. Phys.},
year = {2014},
volume = {},
pages = {},
publisher = {The Royal Society of Chemistry},
doi = {10.1039/C3CP54336F},
url = {http://dx.doi.org/10.1039/C3CP54336F},
abstract = {Equilibrium thermodynamics of a short beta-hairpin are studied using unbiased all-atom replica exchange molecular dynamics simulations in explicit solvent. An exploratory analysis of the free energy landscape of the system is provided in terms of various structural characteristics, for both the folded and unfolded ensembles. We find that the favorable interactions between the ends introduced by the tryptophan cap, along with the flexibility of the turn region, explain the remarkable stability of the folded state. Charging of the N termini results in effective roughening of the free energy landscape and stabilization of non-native contacts. Folding-unfolding dynamics are further discussed using a set of 2413 independent molecular dynamics simulations, 2 ns to 20 ns long, at the melting temperature of the beta-hairpin. A novel method for the construction of Markov models consisting of an iterative refinement of the discretization in reduced dimensionality is presented and used to generate a detailed kinetic network of the system. The hairpin is found to fold heterogeneously on sub-microsecond timescales, with the relative position of the tryptophan side chains driving the selection of the specific pathway.}}

@article{doi:10.1021/ct3008217,
author = {Singh, Gurpreet and Tieleman, D. Peter},
title = {Atomistic Simulations of Wimley–White Pentapeptides: Sampling of Structure and Dynamics in Solution},
journal = {J. Chem. Theory Comput.},
volume = {9},
number = {3},
pages = {1657--1666},
year = {2013},
doi = {10.1021/ct3008217},
URL = {http://pubs.acs.org/doi/abs/10.1021/ct3008217},
eprint = {http://pubs.acs.org/doi/pdf/10.1021/ct3008217},
abstract = {Wimley–White pentapeptides (Ac-WLXLL) can be used as a model system to study lipid–protein interactions as they bind to lipid/water interfaces, like many antimicrobial peptides, and thermodynamic experimental data on their interactions with lipids are available, making them useful for both force field and method testing and development. Here we present a detailed simulation study of Wimley–White (WW) peptides in bulk water to investigate sampling, conformations, and differences due to the different X residue with an eye to future simulations at the lipid/water interface where sampling problems so far have hindered free energy calculations to reproduce the experimental thermodynamic data. We investigate the conformational preferences and slowest relaxation time of WW peptides in bulk water by building Markov State Models (MSM) from Molecular Dynamics (MD) simulation data. We show that clustering based on binning of backbone $\phi$, $\psi$ dihedrals in combination with the community detection algorithm of Blondel et al. provides a quick way of building MSM from large data sets. Our results show that in some cases, implied times even in these small peptides range from 224 to 547 ns. The implications of these slow transitions on determining the potential of mean force profiles of peptide interactions with a lipid bilayer are discussed. }
}

@article{doi:10.1021/acs.jctc.6b00339,
doi = {10.1021/acs.jctc.6b00339},
url = {http://dx.doi.org/10.1021/acs.jctc.6b00339},
year = 2016,
month = {jul},
author = {Ernesto Suárez and Joshua L. Adelman and Daniel M. Zuckerman},
title = {Accurate Estimation of Protein Folding and Unfolding Times: Beyond Markov State Models},
journal = {J. Chem. Theory Comput.},
abstract = {Because standard molecular dynamics (MD) simulations are unable to access time scales of interest in complex biomolecular systems, it is common to "stitch together" information from multiple shorter trajectories using approximate Markov state model (MSM) analysis. However, MSMs may require significant tuning and can yield biased results. Here, by analyzing some of the longest protein MD data sets available (>100 μs per protein), we show that estimators constructed based on exact non-Markovian (NM) principles can yield significantly improved mean first-passage times (MFPTs) for protein folding and unfolding. In some cases, MSM bias of more than an order of magnitude can be corrected when identical trajectory data are reanalyzed by non-Markovian approaches. The NM analysis includes "history" information, higher order time correlations compared to MSMs, that is available in every MD trajectory. The NM strategy is insensitive to fine details of the states used and works well when a fine time-discretization (i.e., small "lag time") is used.}
}

@article{Adelman05072016,
author = {Adelman, Joshua L. and Ghezzi, Chiara and Bisignano, Paola and Loo, Donald D. F. and Choe, Seungho and Abramson, Jeff and Rosenberg, John M. and Wright, Ernest M. and Grabe, Michael}, 
title = {Stochastic steps in secondary active sugar transport},
volume = {113}, 
number = {27}, 
pages = {E3960--E3966},
year = {2016}, 
doi = {10.1073/pnas.1525378113}, 
URL = {http://www.pnas.org/content/113/27/E3960.abstract}, 
eprint = {http://www.pnas.org/content/113/27/E3960.full.pdf}, 
journal = {Proc. Natl. Acad. Sci. USA} ,
abstract = {Secondary active transporters, such as those that adopt the leucine-transporter fold, are found in all domains of life, and they have the unique capability of harnessing the energy stored in ion gradients to accumulate small molecules essential for life as well as expel toxic and harmful compounds. How these proteins couple ion binding and transport to the concomitant flow of substrates is a fundamental structural and biophysical question that is beginning to be answered at the atomistic level with the advent of high-resolution structures of transporters in different structural states. Nonetheless, the dynamic character of the transporters, such as ion/substrate binding order and how binding triggers conformational change, is not revealed from static structures, yet it is critical to understanding their function. Here, we report a series of molecular simulations carried out on the sugar transporter vSGLT that lend insight into how substrate and ions are released from the inward-facing state of the transporter. Our simulations reveal that the order of release is stochastic. Functional experiments were designed to test this prediction on the human homolog, hSGLT1, and we also found that cytoplasmic release is not ordered, but we confirmed that substrate and ion binding from the extracellular space is ordered. Our findings unify conflicting published results concerning cytoplasmic release of ions and substrate and hint at the possibility that other transporters in the superfamily may lack coordination between ions and substrate in the inward-facing state.}
}

@article{Choudhary_2014,
doi = {10.1038/nsmb.2841},
url = {http://dx.doi.org/10.1038/nsmb.2841},
year = 2014,
month = {jun},
publisher = {Nature Publishing Group},
volume = {21},
number = {7},
pages = {626--632},
author = {Om P Choudhary and Aviv Paz and Joshua L Adelman and Jacques-Philippe Colletier and Jeff Abramson and Michael Grabe},
title = {Structure-guided simulations illuminate the mechanism of ATP transport through VDAC1},
journal = {Nat. Struct. Mol. Biol.},
abstract = {The voltage-dependent anion channel (VDAC) mediates the flow of metabolites and ions across the outer mitochondrial membrane of all eukaryotic cells. The open channel passes millions of ATP molecules per second, whereas the closed state exhibits no detectable ATP flux. High-resolution structures of VDAC1 revealed a 19-stranded β-barrel with an α-helix partially occupying the central pore. To understand ATP permeation through VDAC, we solved the crystal structure of mouse VDAC1 (mVDAC1) in the presence of ATP, revealing a low-affinity binding site. Guided by these coordinates, we initiated hundreds of molecular dynamics simulations to construct a Markov state model of ATP permeation. These simulations indicate that ATP flows through VDAC through multiple pathways, in agreement with our structural data and experimentally determined physiological rates.}
}

@article{Shukla_2016,
doi = {10.1038/ncomms10910},
url = {http://dx.doi.org/10.1038/ncomms10910},
year = 2016,
month = {apr},
publisher = {Nature Publishing Group},
volume = {7},
pages = {10910},
author = {Diwakar Shukla and Ariana Peck and Vijay S. Pande},
title = {Conformational heterogeneity of the calmodulin binding interface},
journal = {Nature Communications},
abstract = {Calmodulin (CaM) is a ubiquitous Ca2+ sensor and a crucial signalling hub in many pathways aberrantly activated in disease. However, the mechanistic basis of its ability to bind diverse signalling molecules including G-protein-coupled receptors, ion channels and kinases remains poorly understood. Here we harness the high resolution of molecular dynamics simulations and the analytical power of Markov state models to dissect the molecular underpinnings of CaM binding diversity. Our computational model indicates that in the absence of Ca2+, sub-states in the folded ensemble of CaM's C-terminal domain present chemically and sterically distinct topologies that may facilitate conformational selection. Furthermore, we find that local unfolding is off-pathway for the exchange process relevant for peptide binding, in contrast to prior hypotheses that unfolding might account for binding diversity. Finally, our model predicts a novel binding interface that is well-populated in the Ca2+-bound regime and, thus, a candidate for pharmacological intervention.}
}

@article{Harrigan_2015,
doi = {10.1021/ct5010017},
url = {http://dx.doi.org/10.1021/ct5010017},
year = 2015,
month = {mar},
publisher = {American Chemical Society (ACS)},
volume = {11},
number = {3},
pages = {1094--1101},
author = {Matthew P. Harrigan and Diwakar Shukla and Vijay S. Pande},
title = {Conserve Water: A Method for the Analysis of Solvent in Molecular Dynamics},
journal = {J. Chem. Theory Comput.},
abstract = {Molecular dynamics with explicit solvent is favored for its ability to more correctly simulate aqueous biological processes and has become routine thanks to increasingly powerful computational resources. However, analysis techniques including Markov state models (MSMs) ignore solvent atoms and focus solely on solute coordinates despite solvent being implicated in myriad biological phenomena. We present a unified framework called “solvent-shells featurization” for including solvent degrees of freedom in analysis and show that this method produces better models. We apply this method to simulations of dewetting in the two-domain protein BphC to generate a predictive MSM and identify functional water molecules. Furthermore, the proposed methodology could be easily extended for building MSMs of any systems with indistinguishable components.}
}

@article{Husic_2016,
doi = {10.1063/1.4967809},
url = {http://dx.doi.org/10.1063/1.4967809},
year = {2016},
month = {nov},
volume = {145},
number = {19},
pages = {194103},
author = {Brooke E. Husic and Robert T. McGibbon and Mohammad M. Sultan and Vijay S. Pande},
title = {Optimized parameter selection reveals trends in Markov state models for protein folding},
journal = {J. Chem. Phys.},
abstract = { As molecular dynamics simulations access increasingly longer time scales, complementary advances in the analysis of biomolecular time-series data are necessary. Markov state models offer a powerful framework for this analysis by describing a system’s states and the transitions between them. A recently established variational theorem for Markov state models now enables modelers to systematically determine the best way to describe a system’s dynamics. In the context of the variational theorem, we analyze ultra-long folding simulations for a canonical set of twelve proteins [K. Lindorff-Larsen et al., Science 334, 517 (2011)] by creating and evaluating many types of Markov state models. We present a set of guidelines for constructing Markov state models of protein folding; namely, we recommend the use of cross-validation and a kinetically motivated dimensionality reduction step for improved descriptions of folding dynamics. We also warn that precise kinetics predictions rely on the features chosen to describe the system and pose the description of kinetic uncertainty across ensembles of models as an open issue. }
}