Identification and Analysis of Transition and Metastable Markov States
arXiv:1605.04328 · doi:10.1103/PhysRevX.7.031060
Abstract
We present a new method that enables the identification and analysis of both transition and metastable conformational states from atomistic or coarse-grained molecular dynamics (MD) trajectories. Our algorithm is presented and studied by using both analytical and actual examples from MD simulations of the helix-forming peptide Ala5, and of a larger system, the epidermal growth factor receptor (EGFR) protein. In all cases, our method identifies automatically the corresponding transition states and metastable conformations in an optimal way, with the input of a set of relevant coordinates, by capturing accurately the intrinsic slowest relaxation rate. Our approach provides a general and easy to implement analysis method that provides unique insight into the molecular mechanism and the rare but crucial rate limiting conformational pathways occurring in complex dynamical systems such as molecular trajectories.
References in corpus (8)
- Escaping free-energy minima
- Identification of slow molecular order parameters for Markov model construction
- Elaborating Transition Interface Sampling Methods
- Caliber based spectral gap optimization of order parameters (SGOOP) for sampling complex molecular systems
- Forward Flux Sampling-type schemes for simulating rare events: Efficiency analysis
- Exploring the Free Energy Landscape: From Dynamics to Networks and Back
- Peptide Folding Kinetics from Replica Exchange Molecular Dynamics
- Identification of simple reaction coordinates from complex dynamics
Cited by in corpus (6)
- Special Topic: Markov Models of Molecular Kinetics
- Characterizing metastable states with the help of machine learning
- Correlation Functions, Mean First Passage Times and the Kemeny Constant
- Towards a Benchmark for Markov State Models: The Folding of HP35
- Spectral Map for Slow Collective Variables, Markovian Dynamics, and Transition State Ensembles
- Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant