Fast and reliable analysis of molecular motion using proximity relations and dimensionality reduction
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The analysis of molecular motion starting from extensive sampling of molecular configurations remains an important and challenging task in computational biology. Existing methods require a significant amount of time to extract the most relevant motion information from such data sets. In this work, we provide a practical tool for molecular motion analysis. The proposed method builds upon the recent ScIMAP (Scalable Isomap) method, which, by using proximity relations and dimensionality reduction, has been shown to reliably extract from simulation data a few parameters that capture the main, linear and/or nonlinear, modes of motion of a molecular system. The results we present in the context of protein folding reveal that the proposed method characterizes the folding process essentially as well as ScIMAP. At the same time, by projecting the simulation data and computing proximity relations in a low‐dimensional Euclidean space, it renders such analysis computationally practical. In many instances, the proposed method reduces the computational cost from several CPU months to just a few CPU hours, making it possible to analyze extensive simulation data in a matter of a few hours using only a single processor. These results establish the proposed method as a reliable and practical tool for analyzing motions of considerably large molecular systems and proteins with complex folding mechanisms. Proteins 2007. © 2007 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
A discussion of the solution for the best rotation to relate two sets of vectors
Kabsch, W. (1978) · Acta Crystallographica Section A · doi:10.1107/s0567739478001680 · Cited by 1,151 · cited 1×
“…proximity relations, which assigns to each molecular configuration in the data set a list of nearest neighbors as determined by some distance measure, e.g., lRMSD 52,53 (least root-mean-squared-deviation), constitutes the major bottleneck of ScIMAP, taking over 95% of the total computational time.”
BackgroundDas, P., Moll, M., Stamati, H., Kavraki, L. E., & Clementi, C. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0603553103 · Cited by 331 · cited 6×
“,(10) which was tested on SH3 in that same work, and was used in Das et al.(45) for the first application of ScIMAP.”
MethodInfluentialSelf-citation
Cited by
Unsupervised Learning Methods for Molecular Simulation Data
Glielmo, A., Husic, B. E., Rodriguez, A., Clementi, C., Noé, F., & Laio, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c01195 · Cited by 402
Self-citationSimplifying the representation of complex free-energy landscapes using sketch-map
Ceriotti, M., Tribello, G. A., & Parrinello, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1108486108 · Cited by 340
Determination of reaction coordinates via locally scaled diffusion map
Rohrdanz, M. A., Zheng, W., Maggioni, M., & Clementi, C. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3569857 · Cited by 292
Self-citationMultiscale modeling of emergent materials: biological and soft matter
Murtola, T., Bunker, A., Vattulainen, I., Deserno, M., & Karttunen, M. (2009) · Physical Chemistry Chemical Physics · doi:10.1039/b818051b · Cited by 264
Systematic determination of order parameters for chain dynamics using diffusion maps
Ferguson, A. L., Panagiotopoulos, A. Z., Debenedetti, P. G., & Kevrekidis, I. G. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1003293107 · Cited by 165
Metadata
- Authors
- Plaku, E., Stamati, H., Clementi, C., & Kavraki, L. E.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2007-05
- Volume
- 67
- Issue
- 4
- Pages
- 897-907
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2063935375
- Cited by
- 43
- References
- 4
- FWCI
- 1.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.