“Dividing and Conquering” and “Caching” in Molecular Modeling
Open accessPublished version of a preprint
Abstract
Molecular modeling is widely utilized in subjects including but not limited to physics, chemistry, biology, materials science and engineering. Impressive progress has been made in development of theories, algorithms and software packages. To divide and conquer, and to cache intermediate results have been long standing principles in development of algorithms. Not surprisingly, most important methodological advancements in more than half century of molecular modeling are various implementations of these two fundamental principles. In the mainstream classical computational molecular science, tremendous efforts have been invested on two lines of algorithm development. The first is coarse graining, which is to represent multiple basic particles in higher resolution modeling as a single larger and softer particle in lower resolution counterpart, with resulting force fields of partial transferability at the expense of some information loss. The second is enhanced sampling, which realizes “dividing and conquering” and/or “caching” in configurational space with focus either on reaction coordinates and collective variables as in metadynamics and related algorithms, or on the transition matrix and state discretization as in Markov state models. For this line of algorithms, spatial resolution is maintained but results are not transferable. Deep learning has been utilized to realize more efficient and accurate ways of “dividing and conquering” and “caching” along these two lines of algorithmic research. We proposed and demonstrated the local free energy landscape approach, a new framework for classical computational molecular science. This framework is based on a third class of algorithm that facilitates molecular modeling through partially transferable in resolution “caching” of distributions for local clusters of molecular degrees of freedom. Differences, connections and potential interactions among these three algorithmic directions are discussed, with the hope to stimulate development of more elegant, efficient and reliable formulations and algorithms for “dividing and conquering” and “caching” in complex molecular systems.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Lyubartsev, A. P., & Laaksonen, A. (1995) · Physical Review E · doi:10.1103/physreve.52.3730 · Cited by 852 · see citing works
Markov state models of biomolecular conformational dynamics
Chodera, J. D., & Noé, F. (2014) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2014.04.002 · Cited by 776 · see citing works
Jinnouchi, R., Lahnsteiner, J., Karsai, F., Kresse, G., & Bokdam, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.225701 · Cited by 635 · see citing works
Unsupervised machine learning in atomistic simulations, between predictions and understanding
Ceriotti, M. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5091842 · Cited by 173 · see citing works
‘Scaling molecular dynamics beyond 100, 000 processor cores for large-scale biophysical simulations’
Jung, J., Nishima, W., Daniels, M., Bascom, G., Kobayashi, C., Adedoyin, A., Wall, M., Lappala, A., Phillips, D., Fischer, W., et al. (2019) · Journal of Computational Chemistry · doi:10.1002/jcc.25840 · Cited by 114 · see citing works
Flagged first, then by citations
- Authors
- Cao, X., & Tian, P.
- Affiliations
- Jilin University (CN)
- Corresponding author
- Tian, Pu
- Venue
- International Journal of Molecular Sciences
- Publisher
- MDPI AG
- Published
- 2021-05-10
- Volume
- 22
- Issue
- 9
- Pages
- 5053
- ISSN
- 1422-0067 (ISSN-L)
- PMC
- PMC8126232
- OpenAlex
- W3162742939
- Cited by
- 10
- References
- 5
- Citations by year
- 2024: 2 · 2023: 1 · 2022: 1 · 2021: 6
- FWCI
- 0.26
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- International Journal of Molecular Sciences (publishedVersion, cc-by)
- Preprints.org (acceptedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Key Research and Development Program of China (2017YFB0702500)
- Topics
- Physical Sciences › Chemistry › Physical and Theoretical Chemistry › Advanced Physical and Chemical Molecular Interactions
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- coarse-graining, enhanced sampling, metadynamics, Markov state models, deep learning, free energy distribution, configurational sampling, reaction coordinate, collective variables, transferability
- MeSH terms
- Algorithms, Models, Molecular, Thermodynamics, Molecular Dynamics Simulation
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