Deep clustering of protein folding simulations
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
BACKGROUND: We examine the problem of clustering biomolecular simulations using deep learning techniques. Since biomolecular simulation datasets are inherently high dimensional, it is often necessary to build low dimensional representations that can be used to extract quantitative insights into the atomistic mechanisms that underlie complex biological processes. RESULTS: We use a convolutional variational autoencoder (CVAE) to learn low dimensional, biophysically relevant latent features from long time-scale protein folding simulations in an unsupervised manner. We demonstrate our approach on three model protein folding systems, namely Fs-peptide (14 μs aggregate sampling), villin head piece (single trajectory of 125 μs) and β- β- α (BBA) protein (223 + 102 μs sampling across two independent trajectories). In these systems, we show that the CVAE latent features learned correspond to distinct conformational substates along the protein folding pathways. The CVAE model predicts, on average, nearly 89% of all contacts within the folding trajectories correctly, while being able to extract folded, unfolded and potentially misfolded states in an unsupervised manner. Further, the CVAE model can be used to learn latent features of protein folding that can be applied to other independent trajectories, making it particularly attractive for identifying intrinsic features that correspond to conformational substates that share similar structural features. CONCLUSIONS: Together, we show that the CVAE model can quantitatively describe complex biophysical processes such as protein folding.
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
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
How fast-folding proteins fold
Lindorff-Larsen, K., Piana, S., Dror, R. O., & Shaw, D. E. (2011) · Science · doi:10.1126/science.1208351 · Cited by 1,980
Deep Learning in Drug Discovery
Gawehn, E., Hiss, J. A., & Schneider, G. (2016) · Molecular Informatics · doi:10.1002/minf.201501008 · Cited by 723
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
MSMBuilder2: Modeling Conformational Dynamics on the Picosecond to Millisecond Scale
Beauchamp, K. A., Bowman, G. R., Lane, T. J., Maibaum, L., Haque, I. S., & Pande, V. S. (2011) · Journal of Chemical Theory and Computation · doi:10.1021/ct200463m · Cited by 372
Das, 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
Atomic convolutional networks for predicting protein-ligand binding affinity
Gomes, J., Ramsundar, B., Feinberg, E. N., & Pande, V. S. (2017) · arXiv · doi:10.48550/arxiv.1703.10603 · Cited by 150
Protein Conformational Populations and Functionally Relevant Substates
Ramanathan, A., Savol, A., Burger, V., Chennubhotla, C. S., & Agarwal, P. K. (2014) · Accounts of Chemical Research · doi:10.1021/ar400084s · Cited by 110
Self-citation
Cited by
AlphaFold, Artificial Intelligence (AI), and Allostery
Nussinov, R., Zhang, M., Liu, Y., & Jang, H. (2022) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.2c04346 · Cited by 190
Russo, J. D., Zhang, S., Leung, J. M. G., Bogetti, A. T., Thompson, J. P., DeGrave, A. J., Torrillo, P. A., Pratt, A. J., Wong, K. F., Xia, J., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01154 · Cited by 93
Artificial intelligence guided conformational mining of intrinsically disordered proteins
Gupta, A., Dey, S., Hicks, A., & Zhou, H.-X. (2022) · Communications Biology · doi:10.1038/s42003-022-03562-y · Cited by 56
“…for dimensionality reduction of protein folding trajectories and subsequent identi fi cation of intermediate states by clustering in the latent space 20 , and variational autoencoders and other neural networks for optimal selection of Markov states by training with conformations at a fi xed lag time…”
Background
Metadata
- Authors
- Bhowmik, D., Gao, S., Young, M. T., & Ramanathan, A.
- Venue
- BMC Bioinformatics
- Published
- 2018-12
- Volume
- 19
- Issue
- S18
- Pages
- 484-484
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2953302413
- Cited by
- 89
- References
- 9
- FWCI
- 3.53
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deep clustering of protein folding simulations. https://app.cochat.ai/papers/10.1186/s12859-018-2507-5
- The paper
- Bhowmik, D., Gao, S., Young, M. T., & Ramanathan, A. (2018). Deep clustering of protein folding simulations. BMC Bioinformatics. https://doi.org/10.1186/s12859-018-2507-5
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.