Efficient Construction of Mesostate Networks from Molecular Dynamics Trajectories
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The coarse-graining of data from molecular simulations yields conformational space networks that may be used for predicting the system's long time scale behavior, to discover structural pathways connecting free energy basins in the system, or simply to represent accessible phase space regions of interest and their connectivities in a two-dimensional plot. In this contribution, we present a tree-based algorithm to partition conformations of biomolecules into sets of similar microstates, i.e., to coarse-grain trajectory data into mesostates. On account of utilizing an architecture similar to that of established tree-based algorithms, the proposed scheme operates in near-linear time with data set size. We derive expressions needed for the fast evaluation of mesostate properties and distances when employing typical choices for measures of similarity between microstates. Using both a pedagogically useful and a real-word application, the algorithm is shown to be robust with respect to tree height, which in addition to mesostate threshold size is the main adjustable parameter. It is demonstrated that the derived mesostate networks can preserve information regarding the free energy basins and barriers by which the system is characterized.
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
T RANSITION P ATH S AMPLING : Throwing Ropes Over Rough Mountain Passes, in the Dark
Bolhuis, P. G., Chandler, D., Dellago, C., & Geissler, P. L. (2002) · Annual Review of Physical Chemistry · doi:10.1146/annurev.physchem.53.082301.113146 · Cited by 1,972
Markov models of molecular kinetics: Generation and validation
Prinz, J.-H., Wu, H., Sarich, M., Keller, B., Senne, M., Held, M., Chodera, J. D., Schütte, C., & Noé, F. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3565032 · Cited by 1,275
Constructing the equilibrium ensemble of folding pathways from short off-equilibrium simulations
Noé, F., Schütte, C., Vanden-Eijnden, E., Reich, L., & Weikl, T. R. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0905466106 · Cited by 820
Coarse master equations for peptide folding dynamics
Buchete, N.-V., & Hummer, G. (2008) · The Journal of Physical Chemistry B · doi:10.1021/jp0761665 · Cited by 477
Bowman, G. R., Beauchamp, K. A., Boxer, G., & Pande, V. S. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3216567 · Cited by 396
Cited by
Wei, G., Xi, W., Nussinov, R., & Ma, B. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00562 · Cited by 436
Qiao, Q., Bowman, G. R., & Huang, X. (2013) · Journal of the American Chemical Society · doi:10.1021/ja403147m · Cited by 182
Bowman, G. R. (2012) · The Journal of Chemical Physics · doi:10.1063/1.4755751 · Cited by 76
Hierarchical Nyström methods for constructing Markov state models for conformational dynamics
Yao, Y., Cui, R. Z., Bowman, G. R., Silva, D.-A., Sun, J., & Huang, X. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4802007 · Cited by 69
Metadata
- Authors
- Vitalis, A., & Caflisch, A.
- Venue
- Journal of Chemical Theory and Computation
- Publisher
- American Chemical Society (ACS)
- Published
- 2012-02-10
- Volume
- 8
- Issue
- 3
- Pages
- 1108-1120
- ISSN
- 1549-9618 (ISSN-L)
- 1549-9626
- OpenAlex
- W2320037907
- Cited by
- 44
- References
- 5
- FWCI
- 2.56
- Type
- journal article
- Language
- en
- Open access
- green
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.