Skip to content

Commit 589ebd4

Browse files
committed
Merge branch 'th_rev' of github.com:markovmodel/pyemma_tutorials into th_rev
2 parents 8970a9d + b15a9a5 commit 589ebd4

File tree

4 files changed

+6
-6
lines changed

4 files changed

+6
-6
lines changed

manuscript/manuscript.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -399,7 +399,7 @@ \subsection{Dimensionality reduction}
399399
Discrete jumps between the minima can be observed by visualizing the transformation of the first trajectory into these ICs (Fig.~\ref{fig:io-to-tica}d).
400400
We thus assume that our TICA-transformed backbone torsion features describe one or more metastable processes.
401401

402-
We demonstrate how to apply TICA, suggest how to interpret the projected coordinates and compare the results to other dimension reduction techniques in Notebook (02).
402+
We demonstrate how to apply TICA, suggest how to interpret the projected coordinates, and compare the results to other dimension reduction techniques in Notebook (02).
403403

404404
\begin{figure}
405405
\includegraphics{figure_3}
@@ -568,7 +568,7 @@ \subsection{Connecting the MSM with experimental data}
568568
We see that the predicted relaxation signal has a much larger amplitude for the nonequilibrium initialization,
569569
making it more likely to be experimentally measurable.
570570

571-
Besides a detailed demonstration of the above, Notebook (06) demonstrates how to compute J-couplings and dynamic fingerprints from MSMs.
571+
In addition to a detailed demonstration of the above, Notebook (06) demonstrates how to compute J-couplings and dynamic fingerprints from MSMs.
572572

573573
\subsection{Summary}
574574

@@ -597,7 +597,7 @@ \subsection{Modeling large systems}
597597
we explain how to deal with those in the tutorials (Notebook 00 and 02).
598598

599599
More details on how to model complex systems with the techniques presented here are described, e.g., by~\cite{plattner_protein_2015,plattner_complete_2017}.
600-
We further demonstrate the symptoms of difficult data situations and how to deal with them in Notebook (08).
600+
We further examine some symptoms that may indicate problematic or difficult datasets, and demonstrate how to deal with them in Notebook (08).
601601

602602
\subsection{Advanced Methods}
603603

notebooks/02-dimension-reduction-and-discretization.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -388,7 +388,7 @@
388388
"cell_type": "markdown",
389389
"metadata": {},
390390
"source": [
391-
"Following the previous example, we perform a $k$-means ($100$ centers, stride of $5$) and a regspace clustering ($0.3$ radians center distance) on the full two-dimensional data set and visualize the obtained centers. In [Notebook 03 ➜ 📓](03-msm-estimation-and-validation.ipynb), we show the effect of different numbers of cluster centers."
391+
"Following the previous example, we perform a $k$-means ($100$ centers, stride of $5$) and a regspace clustering ($0.3$ radians center distance) on the full two-dimensional data set and visualize the obtained centers. In [Notebook 03 ➜ 📓](03-msm-estimation-and-validation.ipynb), we show the effect of different numbers of cluster centers on MSM estimation."
392392
]
393393
},
394394
{

notebooks/03-msm-estimation-and-validation.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -241,7 +241,7 @@
241241
"Please note though that this ITS convergence analysis is based on the assumption that $200$ $k$-means centers are sufficient to discretize the dynamics.\n",
242242
"In order to study the influence of the clustering on the ITS convergence,\n",
243243
"we repeat the clustering and ITS convergence analysis for various number of cluster centers.\n",
244-
"For the sake of simplicity, we will restrict ourselves to the $k$-means algorithm; different techniques are presented in [Notebook 02 ➜ 📓](02-dimension-reduction-and-discretization.ipynb)."
244+
"For the sake of simplicity, we will restrict ourselves to the $k$-means algorithm; alternative clustering methods are presented in [Notebook 02 ➜ 📓](02-dimension-reduction-and-discretization.ipynb)."
245245
]
246246
},
247247
{

notebooks/08-common-problems.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -781,7 +781,7 @@
781781
"the TICA lag time was deliberately chosen way too high.\n",
782782
"That's easy to fix.\n",
783783
"\n",
784-
"Let's now have a look at how the metastable trajectories should look like for a decent model such as the one estimated in [Notebook 05 ➜ 📓](05-pcca-tpt.ipynb).\n",
784+
"Let's now have a look at how the metastable trajectories should look for a decent model such as the one estimated in [Notebook 05 ➜ 📓](05-pcca-tpt.ipynb).\n",
785785
"We will take the same input data,\n",
786786
"do a TICA transform with a realistic lag time of $10$ ps,\n",
787787
"and coarse grain into $2$ metastable states in order to compare with the example above."

0 commit comments

Comments
 (0)