The power of coarse graining in biomolecular simulations.
Ontology highlight
ABSTRACT:
SUBMITTER: Ingolfsson HI
PROVIDER: S-EPMC4171755 | biostudies-literature | 2014 May
REPOSITORIES: biostudies-literature
Publications
The power of coarse graining in biomolecular simulations.
Ingólfsson Helgi I HI Lopez Cesar A CA Uusitalo Jaakko J JJ de Jong Djurre H DH Gopal Srinivasa M SM Periole Xavier X Marrink Siewert J SJ
Wiley interdisciplinary reviews. Computational molecular science 20140501 3
Computational modeling of biological systems is challenging because of the multitude of spatial and temporal scales involved. Replacing atomistic detail with lower resolution, coarse grained (CG), beads has opened the way to simulate large-scale biomolecular processes on time scales inaccessible to all-atom models. We provide an overview of some of the more popular CG models used in biomolecular applications to date, focusing on models that retain chemical specificity. A few state-of-the-art exa ...[more]
Similar Datasets
Project description:Advances in experimental and computational techniques allow us to study the structure and dynamics of large biomolecular assemblies at increasingly higher resolution. However, with increasing structural detail it can be challenging to unravel the mechanism underlying the function of molecular machines. One reason is that atomistic simulations become computationally prohibitive. Moreover it is difficult to rationalize the functional mechanism of systems composed of tens of thousands to millions of atoms by following each atom's movements. Coarse graining (CG) allows us to understand biological structures from a hierarchical perspective and to gradually zoom into the adequate level of structural detail. This article introduces a Bayesian approach for coarse graining biomolecular structures. We develop a probabilistic model that aims to represent the shape of an experimental structure as a cloud of bead particles. The particles interact via a pairwise potential whose parameters are estimated along with the bead positions and the CG mapping between atoms and beads. Our model can also be applied to density maps obtained by cryo-electron microscopy. We illustrate our approach on various test systems.
| S-EPMC5560709 | biostudies-literature
Project description:A series of coarse-grained models have been developed for study of the molecular dynamics of RNA nanostructures. The models in the series have one to three beads per nucleotide and include different amounts of detailed structural information. Such a treatment allows us to reach, for systems of thousands of nucleotides, a time scale of microseconds (i.e. by three orders of magnitude longer than in full atomistic modeling) and thus to enable simulations of large RNA polymers in the context of bionanotechnology. We find that the three-beads-per-nucleotide models, described by a set of just a few universal parameters, are able to describe different RNA conformations and are comparable in structural precision to the models where detailed values of the backbone P-C4' dihedrals taken from a reference structure are included. These findings are discussed in the context of RNA conformation classes.
| S-EPMC3767480 | biostudies-literature
Project description:We propose a universal approach for analysis and fast simulations of stiff stochastic biochemical networks, which rests on elimination of fast chemical species without a loss of information about mesoscopic, non-Poissonian fluctuations of the slow ones. Our approach is similar to the Born-Oppenheimer approximation in quantum mechanics and follows from the stochastic path integral representation of the cumulant generating function of reaction events. In applications with a small number of chemical reactions, it produces analytical expressions for cumulants of chemical fluxes between the slow variables. This allows for a low-dimensional, interpretable representation and can be used for high-accuracy, low-complexity coarse-grained numerical simulations. As an example, we derive the coarse-grained description for a chain of biochemical reactions and show that the coarse-grained and the microscopic simulations agree, but the former is 3 orders of magnitude faster.
| S-EPMC2705573 | biostudies-literature
Project description:Many commonly used coarse-grained models for proteins are based on simplified interaction sites and consequently may suffer from significant limitations, such as the inability to properly model protein secondary structure without the addition of restraints. Recent work on a benzene fluid (Lettieri S.; Zuckerman D. M.J. Comput. Chem.2012, 33, 268-275) suggested an alternative strategy of tabulating and smoothing fully atomistic orientation-dependent interactions among rigid molecules or fragments. Here we report our initial efforts to apply this approach to the polar and covalent interactions intrinsic to polypeptides. We divide proteins into nearly rigid fragments, construct distance and orientation-dependent tables of the atomistic interaction energies between those fragments, and apply potential energy smoothing techniques to those tables. The amount of smoothing can be adjusted to give coarse-grained models that range from the underlying atomistic force field all the way to a bead-like coarse-grained model. For a moderate amount of smoothing, the method is able to preserve about 70-90% of the α-helical structure while providing a factor of 3-10 improvement in sampling per unit computation time (depending on how sampling is measured). For a greater amount of smoothing, multiple folding-unfolding transitions of the peptide were observed, along with a factor of 10-100 improvement in sampling per unit computation time, although the time spent in the unfolded state was increased compared with less smoothed simulations. For a β hairpin, secondary structure is also preserved, albeit for a narrower range of the smoothing parameter and, consequently, for a more modest improvement in sampling. We have also applied the new method in a "resolution exchange" setting, in which each replica runs a Monte Carlo simulation with a different degree of smoothing. We obtain exchange rates that compare favorably to our previous efforts at resolution exchange (Lyman E.; Zuckerman D. M.J. Chem. Theory Comput.2006, 2, 656-666).
| S-EPMC4230378 | biostudies-literature
Project description:Modelers of molecular signaling networks must cope with the combinatorial explosion of protein states generated by posttranslational modifications and complex formation. Rule-based models provide a powerful alternative to approaches that require explicit enumeration of all possible molecular species of a system. Such models consist of formal rules stipulating the (partial) contexts wherein specific protein-protein interactions occur. These contexts specify molecular patterns that are usually less detailed than molecular species. Yet, the execution of rule-based dynamics requires stochastic simulation, which can be very costly. It thus appears desirable to convert a rule-based model into a reduced system of differential equations by exploiting the granularity at which rules specify interactions. We present a formal (and automated) method for constructing a coarse-grained and self-consistent dynamical system aimed at molecular patterns that are distinguishable by the dynamics of the original system as posited by the rules. The method is formally sound and never requires the execution of the rule-based model. The coarse-grained variables do not depend on the values of the rate constants appearing in the rules, and typically form a system of greatly reduced dimension that can be amenable to numerical integration and further model reduction techniques.
| S-EPMC2672529 | biostudies-literature
Project description:A variety of coarse-grained (CG) models exists for simulation of proteins. An outstanding problem is the construction of a CG model with physically accurate conformational energetics rivaling all-atom force fields. In the present work, atomistic simulations of peptide folding and aggregation equilibria are force-matched using multiscale coarse-graining to develop and test a CG interaction potential of general utility for the simulation of proteins of arbitrary sequence. The reduced representation relies on multiple interaction sites to maintain the anisotropic packing and polarity of individual sidechains. CG energy landscapes computed from replica exchange simulations of the folding of Trpzip, Trp-cage and adenylate kinase resemble those of other reduced representations; non-native structures are observed with energies similar to those of the native state. The artifactual stabilization of misfolded states implies that non-native interactions play a deciding role in deviations from ideal funnel-like cooperative folding. The role of surface tension, backbone hydrogen bonding and the smooth pairwise CG landscape is discussed. Ab initio folding aside, the improved treatment of sidechain rotamers results in stability of the native state in constant temperature simulations of Trpzip, Trp-cage, and the open to closed conformational transition of adenylate kinase, illustrating the potential value of the CG force field for simulating protein complexes and transitions between well-defined structural states.
| S-EPMC2891700 | biostudies-literature
Project description:Coarse-grained (CG) modeling approaches are widely used to simulate many important biological processes involving DNA, including chromatin folding and genomic packaging. The bending propensity of a semiflexible DNA molecule critically influences these processes. However, existing CG DNA models do not retain a sufficient fidelity of the important local chain motions, whose propagation at larger length scales would generate correct DNA persistent lengths, in particular when the solution's ionic strength is widely varied. Here we report on a development of an accurate CG model for the double-stranded DNA chain, with explicit treatment of mobile ions, derived systematically from all-atom molecular dynamics simulations. Our model generates complex local motions of the DNA chain, similar to fully atomistic dynamics, leading also to a quantitative agreement of our simulation results with the experimental data on the dependence of the DNA persistence length on the solution ionic strength. We also predict a structural transition in a torsionally stressed DNA nanocircle as the buffer ionic strength is increased beyond a threshold value.
| S-EPMC2996671 | biostudies-literature
Project description:Multipole expansions offer a natural path to coarse-graining the electrostatic potential. However, the validity of the expansion is restricted to regions outside a spherical enclosure of the distribution of charge and, therefore, not suitable for most applications that demand accurate representation at arbitrary positions around the molecule. We propose and demonstrate a distributed multipole expansion approach that resolves this limitation. We also provide a practical algorithm for the computational implementation of this approach. The method allows the partitioning of the charge distribution into subsystems so that the multipole expansion of each component of the partition, and therefore of their superposition, is valid outside an enclosing surface of the molecule of arbitrary shape. The complexity of the resulting coarse-grained model of electrostatic potential is dictated by the area of the molecular surface and therefore, for a typical three-dimensional molecule, it scale as N(2/3) with N, the number of charges in the system. This makes the method especially useful for coarse-grained studies of biological systems consisting of many large macromolecules provided that the configuration of the individual molecules can be approximated as fixed.
| S-EPMC3090642 | biostudies-literature
Project description:The "bottom-up" approach to coarse-graining, for building accurate and efficient computational models to simulate large-scale and complex phenomena and processes, is an important approach in computational chemistry, biophysics, and materials science. As one example, the Multiscale Coarse-Graining (MS-CG) approach to developing CG models can be rigorously derived using statistical mechanics applied to fine-grained, i.e., all-atom simulation data for a given system. Under a number of circumstances, a systematic procedure, such as MS-CG modeling, is particularly valuable. Here, we present the development of the OpenMSCG software, a modularized open-source software that provides a collection of successful and widely applied bottom-up CG methods, including Boltzmann Inversion (BI), Force-Matching (FM), Ultra-Coarse-Graining (UCG), Relative Entropy Minimization (REM), Essential Dynamics Coarse-Graining (EDCG), and Heterogeneous Elastic Network Modeling (HeteroENM). OpenMSCG is a high-performance and comprehensive toolset that can be used to derive CG models from large-scale fine-grained simulation data in file formats from common molecular dynamics (MD) software packages, such as GROMACS, LAMMPS, and NAMD. OpenMSCG is modularized in the Python programming framework, which allows users to create and customize modeling "recipes" for reproducible results, thus greatly improving the reliability, reproducibility, and sharing of bottom-up CG models and their applications.
| S-EPMC10577682 | biostudies-literature
Project description:Previous theoretical and data-driven studies on urban mobility uncovered the repeating patterns in individual and collective human behavior. This paper analyzes the travel demand characteristics of mobility networks through studying a coarse-grained representation of individual trips. Building on the idea of reducing the complexity of the mobility network, we investigate the preserved spatial and temporal information in a simplified representations of large-scale origin-destination matrices derived from more than 16 million taxi trip records from New York and Chicago. We reduce the numerous individual flows on the network into four major groups, to uncover latent collective mobility patterns in those cities. The new simplified representation of the origin-destination matrices leads to categorization of trips into distinctive flow types with specific temporal and spatial properties in each city under study. Collocation of the descriptive statistics of flow types within the two cities suggests the generalizability of the proposed approach. We extract an overall displacement metric from each of the major flows to analyze the evolution of their temporal attributes. The new representation of the demand network reveals insightful properties of the mobility system which could not have been identified from the original disaggregated representation.
| S-EPMC6525175 | biostudies-literature