Journal
JOURNAL OF CHEMICAL THEORY AND COMPUTATION
Volume 12, Issue 4, Pages 2091-2100Publisher
AMER CHEMICAL SOC
DOI: 10.1021/acs.jctc.6b00016
Keywords
-
Funding
- National Natural Science Foundation of China [21433004, 21473056]
- Natural Science Foundation of Shanghai [14ZR1411800]
- NYU-ECNU Center for Computational Chemistry at NYU Shanghai
Ask authors/readers for more resources
Coarse-grained (CG) models are valuable tools for the study of functions of large biomolecules on large length and time scales. The definition of CG representations for huge biomolecules is always a formidable challenge. In this work, we propose a new method called fluctuation maximization coarse-graining (FM-CG) to construct the CG sites of biomolecules. The defined residual in FM-CG converges to a maximal value as the number of CG sites increases, allowing an optimal CG model to be rigorously defined on the basis of the maximum. More importantly, we developed a robust algorithm called stepwise local iterative optimization (SLIO) to accelerate the process of coarse-graining large biomolecules. By means of the efficient SLIO algorithm, the computational cost of coarse-graining large biomolecules is reduced to within the time scale of seconds, which is far lower than that of conventional simulated annealing. The coarse-graining of two huge systems, chaperonin GroEL and lengsin, indicates that our new methods can coarse-grain huge biomolecular systems with up to 10 000 residues within the time scale of minutes. The further parametrization of CG sites derived from FM-CG allows us to construct the corresponding CG models for studies of the functions of huge biomolecular systems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available