scholarly journals Internal coarse-graining of molecular systems

2009 ◽  
Vol 106 (16) ◽  
pp. 6453-6458 ◽  
Author(s):  
J. Feret ◽  
V. Danos ◽  
J. Krivine ◽  
R. Harmer ◽  
W. Fontana
Author(s):  
Xiaoyong Cao ◽  
Pu Tian

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 of important methodological advancements in more than half century of molecule modeling are various implementations of these two fundamental principles. In the mainstream classical computational molecular science based on force fields parameterization by coarse graining, 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 no transferability is available. 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 and 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.


2018 ◽  
Vol 136 ◽  
pp. 331-340 ◽  
Author(s):  
Evangelia Kalligiannaki ◽  
Markos Katsoulakis ◽  
Petr Plechac ◽  
Vagelis Harmandaris

2019 ◽  
Vol 151 (4) ◽  
pp. 044116 ◽  
Author(s):  
Feliks Nüske ◽  
Lorenzo Boninsegna ◽  
Cecilia Clementi

2021 ◽  
Vol 22 (9) ◽  
pp. 5053
Author(s):  
Xiaoyong Cao ◽  
Pu Tian

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.


2021 ◽  
Vol 8 ◽  
Author(s):  
Tiedong Sun ◽  
Vishal Minhas ◽  
Nikolay Korolev ◽  
Alexander Mirzoev ◽  
Alexander P. Lyubartsev ◽  
...  

Recent advances in methodology enable effective coarse-grained modeling of deoxyribonucleic acid (DNA) based on underlying atomistic force field simulations. The so-called bottom-up coarse-graining practice separates fast and slow dynamic processes in molecular systems by averaging out fast degrees of freedom represented by the underlying fine-grained model. The resulting effective potential of interaction includes the contribution from fast degrees of freedom effectively in the form of potential of mean force. The pair-wise additive potential is usually adopted to construct the coarse-grained Hamiltonian for its efficiency in a computer simulation. In this review, we present a few well-developed bottom-up coarse-graining methods, discussing their application in modeling DNA properties such as DNA flexibility (persistence length), conformation, “melting,” and DNA condensation.


2015 ◽  
Vol 143 (8) ◽  
pp. 084105 ◽  
Author(s):  
Evangelia Kalligiannaki ◽  
Vagelis Harmandaris ◽  
Markos A. Katsoulakis ◽  
Petr Plecháč

Proceedings ◽  
2020 ◽  
Vol 46 (1) ◽  
pp. 27
Author(s):  
Evangelia Kalligiannaki ◽  
Vagelis Harmandaris ◽  
Markos Katsoulakis

The development of systematic coarse-grained mesoscopic models for complex molecular systems is an intense research area. Here we first give an overview of different methods for obtaining optimal parametrized coarse-grained models, starting from detailed atomistic representation for high dimensional molecular systems. We focus on methods based on information theory, such as relative entropy, showing that they provide parameterizations of coarse-grained models at equilibrium by minimizing a fitting functional over a parameter space. We also connect them with structural-based (inverse Boltzmann) and force matching methods. All the methods mentioned in principle are employed to approximate a many-body potential, the (n-body) potential of mean force, describing the equilibrium distribution of coarse-grained sites observed in simulations of atomically detailed models. We also present in a mathematically consistent way the entropy and force matching methods and their equivalence, which we derive for general nonlinear coarse-graining maps. We apply, and compare, the above-described methodologies in several molecular systems: A simple fluid (methane), water and a polymer (polyethylene) bulk system. Finally, for the latter we also provide reliable confidence intervals using a statistical analysis resampling technique, the bootstrap method.


2010 ◽  
Vol 43 (3) ◽  
pp. 333-371 ◽  
Author(s):  
Valentina Tozzini

AbstractThe last decade has witnessed a renewed interest in the coarse-grained (CG) models for biopolymers, also stimulated by the needs of modern molecular biology, dealing with nano- to micro-sized bio-molecular systems and larger than microsecond timescale. This combination of size and timescale is, in fact, hard to access by atomic-based simulations. Coarse graining the system is a route to be followed to overcome these limits, but the ways of practically implementing it are many and different, making the landscape of CG models very vast and complex.In this paper, the CG models are reviewed and their features, applications and performances compared. This analysis, restricted to proteins, focuses on the minimalist models, namely those reducing at minimum the number of degrees of freedom without losing the possibility of explicitly describing the secondary structures. This class includes models using a single or a few interacting centers (beads) for each amino acid.From this analysis several issues emerge. The difficulty in building these models resides in the need for combining transferability/predictive power with the capability of accurately reproducing the structures. It is shown that these aspects could be optimized by accurately choosing the force field (FF) terms and functional forms, and combining different parameterization procedures. In addition, in spite of the variety of the minimalist models, regularities can be found in the parameters values and in FF terms. These are outlined and schematically presented with the aid of a generic phase diagram of the polypeptide in the parameter space and, hopefully, could serve as guidelines for the development of minimalist models incorporating the maximum possible level of predictive power and structural accuracy.


2012 ◽  
Vol 136 (19) ◽  
pp. 194115 ◽  
Author(s):  
Avisek Das ◽  
Lanyuan Lu ◽  
Hans C. Andersen ◽  
Gregory A. Voth

Author(s):  
Xiaoyong Cao ◽  
Pu Tian

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 of important methodological advancements in more than half century of molecule modeling are various implementations of these two fundamental principles. In the mainstream classical computational molecular science based on force fields parameterization by coarse graining, 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 no transferability is available. 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 and 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.


Sign in / Sign up

Export Citation Format

Share Document