You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: manuscript/manuscript.tex
+10-10Lines changed: 10 additions & 10 deletions
Original file line number
Diff line number
Diff line change
@@ -84,15 +84,15 @@ \section{Introduction}
84
84
85
85
\subsection{Scope}
86
86
87
-
In this tutorial, we assume that the reader is familiar with MD simulation and standard analysis of MD simulations of peptides and proteins, such as computation of torsion angles and distances. (see [7] for a review).
87
+
In this tutorial, we assume that the reader is familiar with MD simulation and standard analysis of MD simulations of peptides and proteins, such as computation of torsion angles and distances. (see~\cite{dror2012biomolecular} for a review).
88
88
89
89
We further assume that the reader is familiar with the basic ideas and theory underlying Markov modeling and will only give a brief reminder of the basic concepts in Section 2.
90
90
91
91
For those seeking further resources, ``\emph{Markov State Models: From an Art to a Science}''~\cite{msm-brooke} provides a recent overview,
92
92
while ``\emph{Markov models of molecular kinetics: Generation and validation}''~\cite{msm-jhp} describes the basic MSM theory and methodology in detail.
93
-
Additionally, two textbooks exist that focus on computational methods and applications~\cite{msm-book} and mathematical theory~\cite{schuette-sarich-book}.
93
+
Additionally, two textbooks have been published that focus on computational methods and applications~\cite{msm-book} and mathematical theory~\cite{schuette-sarich-book}.
94
94
95
-
In addition to publications on theory and application of Markov state modeling~\cite{schuette-msm,buchete-msm-2008,noe-tmat-sampling,bowman-msm-2009,noe-folding-pathways,sarich-msm-quality,noe-fingerprints,noe-dy-neut-scatt,Chodera2014,ben-rev-msm,simon-mech-mod-nmr,oom-feliks,simon-amm},
95
+
In addition to publications on the theory and application of Markov state modeling~\cite{schuette-msm,buchete-msm-2008,noe-tmat-sampling,bowman-msm-2009,noe-folding-pathways,sarich-msm-quality,noe-fingerprints,noe-dy-neut-scatt,Chodera2014,ben-rev-msm,simon-mech-mod-nmr,oom-feliks,simon-amm},
96
96
we also recommend the literature on TICA~\cite{tica,tica3,tica2,kinetic-maps},
97
97
transition path theory (TPT)~\cite{weinan-tpt,metzner-msm-tpt},
98
98
hidden Markov state models (HMMs)~\cite{noe-proj-hid-msm,hmm-baum-welch-alg,hmm-tutorial},
@@ -111,14 +111,14 @@ \subsection{Markov state models}
111
111
\label{sec:theory}
112
112
113
113
Markov state modeling is a mathematical framework for the analysis of time-series data, often but not limited to high-dimensional MD simulation datasets.
114
-
In its standard formulation, the creation of a Markov state model involves decomposing the phase or configuration space occupied by a system into a set of disjoint, discrete states,
114
+
In its standard formulation, the creation of an MSM involves decomposing the phase or configuration space occupied by a dynamical system into a set of disjoint, discrete states,
115
115
and a transition matrix $\mathbf{P}(\tau) = [p_{ij}(\tau)]$ denoting the conditional probability of finding the system in state $j$ at time $t+\tau$ given that it was in state $i$ at time $t$.
116
116
Let us make two remarks to avoid common misconceptions:
117
117
\begin{enumerate}
118
118
\item Equilibrium:
119
119
While most analysis techniques require simulation trajectories to be long enough to sample from the equilibrium distribution, this is not required for MSMs.
120
120
Because MSMs are using the \emph{conditional} probability $p_{ij}(\tau)$,
121
-
they are useful to analyze short simulation trajectories with arbitrary starting points---see~\cite{oom-feliks} for restrictions.
121
+
they are useful for the analysis of short simulation trajectories with arbitrary starting points---see~\cite{oom-feliks} for restrictions.
122
122
\item Markovianity:
123
123
An MSM is a memoryless model.
124
124
Early MSM papers have argued that accurate MSMs can be found if a few states with high barriers are captured by the MSM states so as to achieve a Mori-Zwanzig projection with fast-decaying memory~\cite{swope-its,noe2007jcp,chodera2007jcp}.
@@ -425,8 +425,8 @@ \subsection{Analyzing the MSM}
425
425
where $\pi_j$ denotes the MSM stationary weight of the $j^\textrm{th}$ microstate.
426
426
427
427
In order to interpret the slowest relaxation timescales, we refer to the (right) eigenvectors,
428
-
as they are independent of the stationary distribution.
429
-
This enables us to specifically study what conformational changes are happening on a particular time scale independently of the equilbrium distribution.
428
+
as they are independent of the stationary distribution (see Section~\ref{sec:theory)}.
429
+
This enables us to specifically study what conformational changes are happening on a particular timescale independently of the equilbrium distribution.
430
430
The first right eigenvector corresponds to the stationary process and its eigenvalue is the Perron eigenvalue~$1$.
431
431
The second right eigenvector, on the other hand, corresponds to the slowest process in the system.
432
432
Note that the eigenvectors are real as detailed balance has been enforced during MSM estimation.
@@ -487,7 +487,7 @@ \subsection{Connecting the MSM with experimental data}
487
487
In order to compute the fluorescence correlation functions we require a microscopic,
488
488
instantaneous value of the tryptophan fluorescence for each of the original~$75$ MSM microstates.
489
489
To approximate the fluorescence signal in our pentapeptide system,
490
-
we use the mdtraj library~\cite{mdtraj} to compute the solvent accessible surface area (SASA) of Trp-1.
490
+
we use the mdtraj library~\cite{mdtraj} to compute the solvent accessible surface area (SASA)~\cite{sasa-calculation} of Trp-1.
491
491
Now that we have an approximation of the fluorescence in each of our MSM states,
492
492
we can use PyEMMA to compute the fluorescence autocorrelation function (ACF) from our MSM (\ref{fig:msm-exp-obs}a).
493
493
Note how the computed ACF has a very small response (i.e., signal amplitude).
@@ -542,7 +542,7 @@ \subsection{Advanced Methods}
542
542
543
543
Another issue often faced during Markov state modeling is a lack of quantitative agreement with complementary experimental data.
544
544
This issue is not intrinsic to the Markov state modeling approach as such,
545
-
but rather associated with systematic errors in the force field model used to conduct the simulation.
545
+
but rather is associated with systematic errors in the force field model used to conduct the simulation.
546
546
Nevertheless, using Augmented Markov models (AMM) it is possible to build an integrative MSM which balances experimental and simulation data,
547
547
taking into account their respective uncertainties~\cite{simon-amm}.
548
548
AMMs are implemented in PyEMMA.
@@ -551,7 +551,7 @@ \subsection{Advanced Methods}
551
551
reducing dimension, discretizing, MSM estimation and coarse-graining) by a single end-to-end deep learning method such as VAMPnets~\cite{vampnet}.
552
552
Other deep learning methods for performing the dimension reduction~\cite{tae},
553
553
finding reaction coordinates for enhanced sampling~\cite{hernandez-vde,Sultan2018-vde-enhanced-sampling,Ribeiro2018-rave},
554
-
and generative MSMs~\cite{deep-gen-msm-preprint} have been put forward and are likely to spawn an active field of research on its own right.
554
+
and generative MSMs~\cite{deep-gen-msm-preprint} have been put forward and are likely to spawn an active field of research in its own right.
555
555
Implementations of some of these methods are available or are under development in the deeptime package \url{github.com/markovmodel/deeptime}.
0 commit comments