2019
DOI: 10.1007/978-1-4939-9608-7_19
|View full text |Cite
|
Sign up to set email alerts
|

Using Data-Reduction Techniques to Analyze Biomolecular Trajectories

Abstract: This chapter discusses the way in which dimensionality reduction algorithms such as diffusion maps and sketch-map can be used to analyze molecular dynamics trajectories. The first part discusses how these various algorithms function as well as practical issues such as landmark selection and how these algorithms can be used when the data to be analyzed comes from enhanced sampling trajectories. In the later parts a comparison between the results obtained by applying various algorithms to two sets of sample data… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 78 publications
(98 reference statements)
0
11
0
Order By: Relevance
“…However, the interpretation of the MD data in terms of molecular mechanisms is not straightforward, because of the very high number of variables, and because it is hard to decipher the precise mechanistic details on how residues functionally cooperate. This problem prompted the development of a variety of methods aimed at dimensionality reduction 60,61 . Among these methods, PCA analysis 53 of the Cartesian coordinate covariance matrix has been widely used to determine collective variables.…”
Section: Discussionmentioning
confidence: 99%
“…However, the interpretation of the MD data in terms of molecular mechanisms is not straightforward, because of the very high number of variables, and because it is hard to decipher the precise mechanistic details on how residues functionally cooperate. This problem prompted the development of a variety of methods aimed at dimensionality reduction 60,61 . Among these methods, PCA analysis 53 of the Cartesian coordinate covariance matrix has been widely used to determine collective variables.…”
Section: Discussionmentioning
confidence: 99%
“…A common way to reduce the size of a training set is to employ a landmark selection scheme before performing a dimensionality reduction. The idea is to select a subset of the feature samples (i.e., landmarks) representing the underlying characteristics of the simulation data.…”
Section: Methodsmentioning
confidence: 99%
“…As a final test of our embeddings, we follow the approach presented by Tribello and Gasparotto 83,84 to compare different dimensionality reduction methods. We calculate distances between points in the high-dimensional feature space and the corresponding distances between points in the low-dimensional latent (i.e., CV) space given by the embeddings.…”
Section: B Alanine Dipeptidementioning
confidence: 99%
“…Instead, we need to select an appropriate number of landmark features (∼ 1000) that best represent the underlying simulation data. 83,84 Ideally, we want the landmark features to be representative of the equilibrium distribution. In unbiased simulations, we can achieve this by selecting landmarks at random, or by collecting landmarks at some given frequency.…”
Section: Well-tempered Landmark Selectionmentioning
confidence: 99%
See 1 more Smart Citation