Topological methods for exploring low-density states in biomolecular folding pathways
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Characterization of transient intermediate or transition states is crucial for the description of biomolecular folding pathways, which is, however, difficult in both experiments and computer simulations. Such transient states are typically of low population in simulation samples. Even for simple systems such as RNA hairpins, recently there are mounting debates over the existence of multiple intermediate states. In this paper, we develop a computational approach to explore the relatively low populated transition or intermediate states in biomolecular folding pathways, based on a topological data analysis tool, MAPPER, with simulation data from large-scale distributed computing. The method is inspired by the classical Morse theory in mathematics which characterizes the topology of high-dimensional shapes via some functional level sets. In this paper we exploit a conditional density filter which enables us to focus on the structures on pathways, followed by clustering analysis on its level sets, which helps separate low populated intermediates from high populated folded/unfolded structures. A successful application of this method is given on a motivating example, a RNA hairpin with GCAA tetraloop, where we are able to provide structural evidence from computer simulations on the multiple intermediate states and exhibit different pictures about unfolding and refolding pathways. The method is effective in dealing with high degree of heterogeneity in distribution, capturing structural features in multiple pathways, and being less sensitive to the distance metric than nonlinear dimensionality reduction or geometric embedding methods. The methodology described in this paper admits various implementations or extensions to incorporate more information and adapt to different settings, which thus provides a systematic tool to explore the low-density intermediate states in complex biomolecular folding systems.
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
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585 · cited 8×
“Moreover, ISOMAP is too sensitive to the metric in choice.”
BackgroundMethodInfluentialCoifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675
Milnor, J. (1963) · doi:10.1515/9781400881802 · Cited by 1,390
Finding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition
Singh, G., Memoli, F., & Carlsson, G. (2007) · The Eurographics Association · doi:10.2312/spbg/spbg07/091-100 · Cited by 514
Self-citationDas, 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 5×
“It is often expected that the pathway samples are concentrated around some low dimensional manifolds which can be described by a relatively small number of intrinsic reaction coordinates [8].”
BackgroundMethodInfluentialStructural Insight into RNA Hairpin Folding Intermediates
Bowman, G. R., Huang, X., Yao, Y., Sun, J., Carlsson, G., Guibas, L. J., & Pande, V. S. (2008) · Journal of the American Chemical Society · doi:10.1021/ja8032857 · Cited by 101
Self-citation
Cited by
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
“Clustering methods include manual clustering [52], k-means clustering [22], k-centers clustering [49], density-based clustering [79, 80] and adaptive clustering approaches [39].”
MethodPyEMMA 2: A Software Package for Estimation, Validation, and Analysis of Markov Models
Scherer, M. K., Trendelkamp-Schroer, B., Paul, F., Pérez-Hernández, G., Hoffmann, M., Plattner, N., Wehmeyer, C., Prinz, J.-H., & Noé, F. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5b00743 · Cited by 1,163
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
Extracting insights from the shape of complex data using topology
Lum, P. Y., Singh, G., Lehman, A., Ishkanov, T., Vejdemo-Johansson, M., Alagappan, M., Carlsson, J., & Carlsson, G. (2013) · Scientific Reports · doi:10.1038/srep01236 · Cited by 528
Self-citationDetermination 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
Cang, Z., Mu, L., & Wei, G.-W. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005929 · Cited by 257
Persistent homology analysis of protein structure, flexibility, and folding
Xia, K., & Wei, G. (2014) · International Journal for Numerical Methods in Biomedical Engineering · doi:10.1002/cnm.2655 · Cited by 254
“Compared with computational topology [67, 68] and/or computational homology, persistent homology inherently has an additional dimension, the filtration parameter, which can be utilized to embed some crucial geometric or quantitative information into the topological invariants.”
Towards a new approach to reveal dynamical organization of the brain using topological data analysis
Saggar, M., Sporns, O., Gonzalez-Castillo, J., Bandettini, P. A., Carlsson, G., Glover, G., & Reiss, A. L. (2018) · Nature Communications · doi:10.1038/s41467-018-03664-4 · Cited by 253
“…Mapper has been previously applied to reveal the shape of genetic data in breast-cancer patients 31 , neuronal data from the visual cortex 32 , biomolecular folding pathways 33 , voting behavior in the U.S. House of Representatives 29 , and anatomical data in patients with fragile X syndrome 30 .”
MethodSelf-citationTopological data analysis for discovery in preclinical spinal cord injury and traumatic brain injury
Nielson, J. L., Paquette, J., Liu, A. W., Guandique, C. F., Tovar, C. A., Inoue, T., Irvine, K.-A., Gensel, J. C., Kloke, J., Petrossian, T. C., et al. (2015) · Nature Communications · doi:10.1038/ncomms9581 · Cited by 209
Self-citationWang, M., Cang, Z., & Wei, G.-W. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0149-6 · Cited by 202
Cang, Z., & Wei, G. (2018) · International Journal for Numerical Methods in Biomedical Engineering · doi:10.1002/cnm.2914 · Cited by 172
A topological approach for protein classification
Cang, Z., Mu, L., Wu, K., Opron, K., Xia, K., & Wei, G.-W. (2015) · Computational and Mathematical Biophysics · doi:10.1515/mlbmb-2015-0009 · Cited by 93
“Compared with traditional computational topology [22, 66, 113] and/or computational homology, persistent homology inherently has an additional dimension, the filtration parameter, which can be utilized to embed some crucial geometric or quantitative information into the topological invariants.”
BackgroundHierarchical 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
Self-citationMarkov models and dynamical fingerprints: Unraveling the complexity of molecular kinetics
Keller, B. G., Prinz, J.-H., & Noé, F. (2012) · Chemical Physics · doi:10.1016/j.chemphys.2011.08.021 · Cited by 59
Metadata
- Authors
- Yao, Y., Sun, J., Huang, X., Bowman, G. R., Singh, G., Lesnick, M., Guibas, L. J., Pande, V. S., & Carlsson, G.
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2009-04-14
- Volume
- 130
- Issue
- 14
- Pages
- 144115-144115
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2043012057
- Cited by
- 129
- References
- 8
- FWCI
- 1.80
- Type
- journal article
- Language
- en
- Open access
- bronze
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.