Defining coarse-grained representations of large biomolecules and biomolecular complexes from elastic network models

Unraveling internal friction in a coarse-grained protein model

Understanding the dynamic behavior of complex biomolecules requires simplified models that not only make computations feasible but also reveal fundamental mechanisms. Coarse-graining (CG) achieves this by grouping atoms into beads, whose stochastic dynamics can be derived using the Mori-Zwanzig formalism, capturing both reversible and irreversible interactions. In liquid, the dissipative bead-bead interactions have so far been restricted to hydrodynamic couplings. However, friction does not only arise from the solvent but, notably, from the internal degrees of freedom missing in the CG beads. This leads to an additional "internal friction" whose relevance is studied in this contribution. By comparing with all-atom molecular dynamics (MD), we neatly show that in order to accurately reproduce the dynamics of a globular protein in water using a CG model, not only a precise determination of elastic couplings and the Stokesian self-friction of each bead is required. Critically, the inclusion of internal friction between beads is also necessary for a faithful representation of protein dynamics. We propose to optimize the parameters of the CG model through a self-averaging method that integrates the CG dynamics with an evolution equation for the CG parameters. This approach ensures that selected quantities, such as the radial distribution function and the time correlation of bead velocities, match the corresponding MD values.

Generating Protein Structures for Pathway Discovery Using Deep Learning

Resolving the intricate details of biological phenomena at the molecular level is fundamentally limited by both length- and time scales that can be probed experimentally. Molecular dynamics (MD) simulations at various scales are powerful tools frequently employed to offer valuable biological insights beyond experimental resolution. However, while it is relatively simple to observe long-lived, stable configurations of, for example, proteins, at the required spatial resolution, simulating the more interesting rare transitions between such states often takes orders of magnitude longer than what is feasible even on the largest supercomputers available today. One common aspect of this challenge is pathway discovery, where the start and end states of a scientific phenomenon are known or can be approximated, but the mechanistic details in between are unknown. Here, we propose a representation-learning-based solution that uses interpolation and extrapolation in an abstract representation space to synthesize potential transition states, which are automatically validated using MD simulations. The new simulations of the synthesized transition states are subsequently incorporated into the representation learning, leading to an iterative framework for targeted path sampling. Our approach is demonstrated by recovering the transition of a RAS-RAF protein domain (CRD) from membrane-free to interacting with the membrane using coarse-grain MD simulations.

Analysis of mapping atomic models to coarse-grained resolution

Low-resolution coarse-grained (CG) models provide significant computational and conceptual advantages for simulating soft materials. However, the properties of CG models depend quite sensitively upon the mapping, M, that maps each atomic configuration, r, to a CG configuration, R. In particular, M determines how the configurational information of the atomic model is partitioned between the mapped ensemble of CG configurations and the lost ensemble of atomic configurations that map to each R. In this work, we investigate how the mapping partitions the atomic configuration space into CG and intra-site components. We demonstrate that the corresponding coordinate transformation introduces a nontrivial Jacobian factor. This Jacobian factor defines a labeling entropy that corresponds to the uncertainty in the atoms that are associated with each CG site. Consequently, the labeling entropy effectively transfers configurational information from the lost ensemble into the mapped ensemble. Moreover, our analysis highlights the possibility of resonant mappings that separate the atomic potential into CG and intra-site contributions. We numerically illustrate these considerations with a Gaussian network model for the equilibrium fluctuations of actin. We demonstrate that the spectral quality, Q, provides a simple metric for identifying high quality representations for actin. Conversely, we find that neither maximizing nor minimizing the information content of the mapped ensemble results in high quality representations. However, if one accounts for the labeling uncertainty, Q(M) correlates quite well with the adjusted configurational information loss, Îmap(M), that results from the mapping.

Concentration-Dependent Diffusion of Monoclonal Antibodies: Underlying Mechanisms of Anomalous Diffusion

The development, storage, transport, and subcutaneous delivery of highly concentrated monoclonal antibody formulations pose significant challenges due to the high solution viscosity and low diffusion of the antibody molecules in crowded environments. These issues often stem from the self-associating behavior of the antibody molecules, potentially leading to aggregation. In this work, we used a dissipative particle dynamics-based coarse-grained model to investigate the diffusion behavior of IgG1 antibody molecules in aqueous solutions with 15 and 32 mM NaCl and antibody concentrations ranging from 10 to 400 mg/mL. We determined the coarse-grained interaction parameters by matching the calculated structure factor with the computational and experimental data from the literature. Our results indicate Fickian diffusion for antibody concentrations of 10 and 25 mg/mL and anomalous diffusion for concentrations exceeding 50 mg/mL. The anomalous diffusion was observed for ∼0.33 to 0.4 μs, followed by Fickian diffusion for all antibody concentrations. We observed a strong linear correlation between the diffusion behavior of the antibody molecules (diffusion coefficient D and anomalous diffusion exponent α) and the amount of aggregates present in the solution and between the amount of aggregates and the Coulomb interaction energy. The investigation of underlying mechanisms for anomalous diffusion revealed that in crowded environments at high antibody concentrations, the attractive interaction between electrostatically complementary regions of the antibody molecules could further bring the neighboring molecules closer to one another, ultimately resulting in aggregate formation. Further, the Coulomb attraction can continue to draw more molecules together, forming larger aggregates.

Maximum Entropy Theory of Multiscale Coarse-Graining via Matching Thermodynamic Forces: Application to a Molecular Crystal (TATB)

The MSCG/FM (multiscale coarse-graining via force-matching) approach is an efficient supervised machine learning method to develop microscopically informed coarse-grained (CG) models. We present a theory based on the principle of maximum entropy (PME) enveloping the existing MSCG/FM approaches. This theory views the MSCG/FM method as a special case of matching the thermodynamic forces from the extended ensemble described by the set of thermodynamic (relevant) system coordinates. This set may include CG coordinates, the stress tensor, applied external fields, and so forth, and may be characterized by nonequilibrium conditions. Following the presentation of the theory, we discuss the consistent matching of both bonded and nonbonded interactions. The proposed PME formulation is used as a starting point to extend the MSCG/FM method to the constant strain ensemble, which together with the explicit matching of the bonded forces is better suited for coarse-graining anisotropic media at a submolecular resolution. The theory is demonstrated by performing the fine coarse-graining of crystalline 1,3,5-triamino-2,4,6-trinitrobenzene (TATB), a well-known insensitive molecular energetic material, which exhibits highly anisotropic mechanical properties.

Surveying the energy landscape of coarse-grained mappings

Simulations of soft materials often adopt low-resolution coarse-grained (CG) models. However, the CG representation is not unique and its impact upon simulated properties is poorly understood. In this work, we investigate the space of CG representations for ubiquitin, which is a typical globular protein with 72 amino acids. We employ Monte Carlo methods to ergodically sample this space and to characterize its landscape. By adopting the Gaussian network model as an analytically tractable atomistic model for equilibrium fluctuations, we exactly assess the intrinsic quality of each CG representation without introducing any approximations in sampling configurations or in modeling interactions. We focus on two metrics, the spectral quality and the information content, that quantify the extent to which the CG representation preserves low-frequency, large-amplitude motions and configurational information, respectively. The spectral quality and information content are weakly correlated among high-resolution representations but become strongly anticorrelated among low-resolution representations. Representations with maximal spectral quality appear consistent with physical intuition, while low-resolution representations with maximal information content do not. Interestingly, quenching studies indicate that the energy landscape of mapping space is very smooth and highly connected. Moreover, our study suggests a critical resolution below which a "phase transition" qualitatively distinguishes good and bad representations.

K-Means Clustering Coarse-Graining (KMC-CG): A Next Generation Methodology for Determining Optimal Coarse-Grained Mappings of Large Biomolecules

Coarse-grained (CG) molecular dynamics (MD) has become a method of choice for simulating various large scale biomolecular processes; therefore, the systematic definition of the CG mappings for biomolecules remains an important topic. Appropriate CG mappings can significantly enhance the representability of a CG model and improve its ability to capture critical features of large biomolecules. In this work, we present a systematic and more generalized method called K-means clustering coarse-graining (KMC-CG), which builds on the earlier approach of essential dynamics coarse-graining (ED-CG). KMC-CG removes the sequence-dependent constraints of ED-CG, allowing it to explore a more extensive space and thus enabling the discovery of more physically optimal CG mappings. Furthermore, the implementation of the K-means clustering algorithm can variationally optimize the CG mapping with efficiency and stability. This new method is tested in three cases: ATP-bound G-actin, the HIV-1 CA pentamer, and the Arp2/3 complex. In these examples, the CG models generated by KMC-CG are seen to better capture the structural, dynamic, and functional domains. KMC-CG therefore provides a robust and consistent approach to generating CG models of large biomolecules that can then be more accurately parametrized by either bottom-up or top-down CG force fields.

Developing Hybrid All-Atom and Ultra-Coarse-Grained Models to Investigate Taxol-Binding and Dynein Interactions on Microtubules

Simulating the conformations and functions of biological macromolecules by using all-atom (AA) models is a challenging task due to expensive computational costs. One possible strategy to solve this problem is to develop hybrid all-atom and ultra-coarse-grained (AA/UCG) models of the biological macromolecules. In the AA/UCG scheme, the interest regions are described by AA models, while the other regions are described in the UCG representation. In this study, we develop the hybrid AA/UCG models and apply them to investigate the conformational changes of microtubule-bound tubulins. The simulation results of the hybrid models elucidated the mechanism of why the taxol molecules selectively bound microtubules but not tubulin dimers. In addition, we also explore the interactions of the microtubules and dyneins. Our study shows that the hybrid AA/UCG model has great application potential in studying the function of complex biological systems.

Hierarchical Machine Learning of Low-Resolution Coarse-Grained Free Energy Potentials

A force-matching-based method for supervised machine learning (ML) of coarse-grained (CG) free energy (FE) potentials─known as multiscale coarse-graining via force-matching (MSCG/FM)─is an efficient method to develop microscopically informed CG models that are thermodynamically and statistically equivalent to the reference microscopic models. For low-resolution models, when the coarse-graining is at supramolecular scales, objective-oriented clustering of nonbonded particles is required and the reduced description becomes a function of the clustering algorithm. In the present work, we explore the dependence of the ML of the CG Helmholtz FE potential on the clustering algorithm. We consider coarse-graining based on partitional (k-means, leading to Voronoi diagram) and hierarchical agglomerative (bottom-up) clustering algorithms common in unsupervised ML and develop theory connecting the MSCG/FM learned CG Helmholtz potential and the clustering statistics. By combining the agglomerative clustering and the MSCG/FM learning in a recursive manner, we propose an efficient ML methodology to develop the fine-to-low resolution hierarchies of the CG models. The methodology does not suffer from degrading accuracy or increased computational cost to construct larger hierarchies and as such does not impose an upper size limitation of the CG particles resulting from the extended hierarchies. The utility of the methodology is demonstrated by obtaining the bottom-up agglomerative hierarchy for liquid nitromethane from all-atom molecular dynamics (MD) simulations. For agglomerative hierarchies, we prove the existence of renormalization group transformations that indicate self-similarity and allow for learning the low-resolution MSCG/FM potentials at low computational cost by rescaling and renormalizing the certain finer-resolution members of the hierarchy. The hierarchies of the CG models can be used to carry out simulations under constant-pressure conditions.

Performance efficient macromolecular mechanics via sub-nanometer shape based coarse graining

Dimensionality reduction via coarse grain modeling is a valuable tool in biomolecular research. For large assemblies, ultra coarse models are often knowledge-based, relying on a priori information to parameterize models thus hindering general predictive capability. Here, we present substantial advances to the shape based coarse graining (SBCG) method, which we refer to as SBCG2. SBCG2 utilizes a revitalized formulation of the topology representing network which makes high-granularity modeling possible, preserving atomistic details that maintain assembly characteristics. Further, we present a method of granularity selection based on charge density Fourier Shell Correlation and have additionally developed a refinement method to optimize, adjust and validate high-granularity models. We demonstrate our approach with the conical HIV-1 capsid and heteromultimeric cofilin-2 bound actin filaments. Our approach is available in the Visual Molecular Dynamics (VMD) software suite, and employs a CHARMM-compatible Hamiltonian that enables high-performance simulation in the GPU-resident NAMD3 molecular dynamics engine.

Internal Normal Mode Analysis Applied to RNA Flexibility and Conformational Changes

We investigated the capability of internal normal modes to reproduce RNA flexibility and predict observed RNA conformational changes and, notably, those induced by the formation of RNA-protein and RNA-ligand complexes. Here, we extended our iNMA approach developed for proteins to study RNA molecules using a simplified representation of the RNA structure and its potential energy. Three data sets were also created to investigate different aspects. Despite all the approximations, our study shows that iNMA is a suitable method to take into account RNA flexibility and describe its conformational changes opening the route to its applicability in any integrative approach where these properties are crucial.

Bottom-up Coarse-Graining: Principles and Perspectives

Large-scale computational molecular models provide scientists a means to investigate the effect of microscopic details on emergent mesoscopic behavior. Elucidating the relationship between variations on the molecular scale and macroscopic observable properties facilitates an understanding of the molecular interactions driving the properties of real world materials and complex systems (e.g., those found in biology, chemistry, and materials science). As a result, discovering an explicit, systematic connection between microscopic nature and emergent mesoscopic behavior is a fundamental goal for this type of investigation. The molecular forces critical to driving the behavior of complex heterogeneous systems are often unclear. More problematically, simulations of representative model systems are often prohibitively expensive from both spatial and temporal perspectives, impeding straightforward investigations over possible hypotheses characterizing molecular behavior. While the reduction in resolution of a study, such as moving from an atomistic simulation to that of the resolution of large coarse-grained (CG) groups of atoms, can partially ameliorate the cost of individual simulations, the relationship between the proposed microscopic details and this intermediate resolution is nontrivial and presents new obstacles to study. Small portions of these complex systems can be realistically simulated. Alone, these smaller simulations likely do not provide insight into collectively emergent behavior. However, by proposing that the driving forces in both smaller and larger systems (containing many related copies of the smaller system) have an explicit connection, systematic bottom-up CG techniques can be used to transfer CG hypotheses discovered using a smaller scale system to a larger system of primary interest. The proposed connection between different CG systems is prescribed by (i) the CG representation (mapping) and (ii) the functional form and parameters used to represent the CG energetics, which approximate potentials of mean force (PMFs). As a result, the design of CG methods that facilitate a variety of physically relevant representations, approximations, and force fields is critical to moving the frontier of systematic CG forward. Crucially, the proposed connection between the system used for parametrization and the system of interest is orthogonal to the optimization used to approximate the potential of mean force present in all systematic CG methods. The empirical efficacy of machine learning techniques on a variety of tasks provides strong motivation to consider these approaches for approximating the PMF and analyzing these approximations.

Building an extensible cell wall

This article recounts, from my perspective of four decades in this field, evolving paradigms of primary cell wall structure and the mechanism of surface enlargement of growing cell walls. Updates of the structures, physical interactions, and roles of cellulose, xyloglucan, and pectins are presented. This leads to an example of how a conceptual depiction of wall structure can be translated into an explicit quantitative model based on molecular dynamics methods. Comparison of the model's mechanical behavior with experimental results provides insights into the molecular basis of complex mechanical behaviors of primary cell wall and uncovers the dominant role of cellulose-cellulose interactions in forming a strong yet extensible network.

Ultra-coarse-graining modeling of liquid water

It is a great challenge to develop ultra-coarse-grained models in simulations of biological macromolecules. In this study, the original coarse-graining strategy proposed in our previous work [M. Li and J. Z. H. Zhang, Phys. Chem. Chem. Phys. 23, 8926 (2021)] is first extended to the ultra-coarse-graining (UCG) modeling of liquid water, with the N_C increasing from 4-10 to 20-500. The UCG force field is parameterized by the top-down strategy and subsequently refined on important properties of liquid water by the trial-and-error scheme. The optimal cutoffs for non-bonded interactions in the N_C = 20/100/500 UCG simulations are, respectively, determined on energy convergence. The results show that the average density at 300 K can be accurately reproduced from the well-refined UCG models while it is largely different in describing compressibility, self-diffusion coefficient, etc. The density-temperature relationships predicted by these UCG models are in good agreement with the experiment result. Besides, two polarizable states of the UCG molecules are observed after simulated systems are equilibrated. The ion-water RDFs from the ion-involved N_C = 100 UCG simulation are nearly in accord with the scaled AA ones. Furthermore, the concentration of ions can influence the ratio of two polarizable states in the N_C = 100 simulation. Finally, it is illustrated that the proposed UCG models can accelerate liquid water simulation by 114-135 times, compared with the TIP3P force field. The proposed UCG force field is simple, generic, and transferable, potentially providing valuable information for UCG simulations of large biomolecules.

From System Modeling to System Analysis: The Impact of Resolution Level and Resolution Distribution in the Computer-Aided Investigation of Biomolecules

The ever increasing computer power, together with the improved accuracy of atomistic force fields, enables researchers to investigate biological systems at the molecular level with remarkable detail. However, the relevant length and time scales of many processes of interest are still hardly within reach even for state-of-the-art hardware, thus leaving important questions often unanswered. The computer-aided investigation of many biological physics problems thus largely benefits from the usage of coarse-grained models, that is, simplified representations of a molecule at a level of resolution that is lower than atomistic. A plethora of coarse-grained models have been developed, which differ most notably in their granularity; this latter aspect determines one of the crucial open issues in the field, i.e. the identification of an optimal degree of coarsening, which enables the greatest simplification at the expenses of the smallest information loss. In this review, we present the problem of coarse-grained modeling in biophysics from the viewpoint of system representation and information content. In particular, we discuss two distinct yet complementary aspects of protein modeling: on the one hand, the relationship between the resolution of a model and its capacity of accurately reproducing the properties of interest; on the other hand, the possibility of employing a lower resolution description of a detailed model to extract simple, useful, and intelligible information from the latter.

Coarse-Grained Simulation of Mechanical Properties of Single Microtubules With Micrometer Length

Microtubules are one of the most important components in the cytoskeleton and play a vital role in maintaining the shape and function of cells. Because single microtubules are some micrometers long, it is difficult to simulate such a large system using an all-atom model. In this work, we use the newly developed convolutional and K-means coarse-graining (CK-CG) method to establish an ultra-coarse-grained (UCG) model of a single microtubule, on the basis of the low electron microscopy density data of microtubules. We discuss the rationale of the micro-coarse-grained microtubule models of different resolutions and explore microtubule models up to 12-micron length. We use the devised microtubule model to quantify mechanical properties of microtubules of different lengths. Our model allows mesoscopic simulations of micrometer-level biomaterials and can be further used to study important biological processes related to microtubule function.

An Information-Theory-Based Approach for Optimal Model Reduction of Biomolecules

In theoretical modeling of a physical system, a crucial step consists of the identification of those degrees of freedom that enable a synthetic yet informative representation of it. While in some cases this selection can be carried out on the basis of intuition and experience, straightforward discrimination of the important features from the negligible ones is difficult for many complex systems, most notably heteropolymers and large biomolecules. We here present a thermodynamics-based theoretical framework to gauge the effectiveness of a given simplified representation by measuring its information content. We employ this method to identify those reduced descriptions of proteins, in terms of a subset of their atoms, that retain the largest amount of information from the original model; we show that these highly informative representations share common features that are intrinsically related to the biological properties of the proteins under examination, thereby establishing a bridge between protein structure, energetics, and function.

Ligand-protein interactions in lysozyme investigated through a dual-resolution model

A fully atomistic (AT) modeling of biological macromolecules at relevant length- and time-scales is often cumbersome or not even desirable, both in terms of computational effort required and a posteriori analysis. This difficulty can be overcome with the use of multiresolution models, in which different regions of the same system are concurrently described at different levels of detail. In enzymes, computationally expensive AT detail is crucial in the modeling of the active site in order to capture, for example, the chemically subtle process of ligand binding. In contrast, important yet more collective properties of the remainder of the protein can be reproduced with a coarser description. In the present work, we demonstrate the effectiveness of this approach through the calculation of the binding free energy of hen egg white lysozyme with the inhibitor di-N-acetylchitotriose. Particular attention is payed to the impact of the mapping, that is, the selection of AT and coarse-grained residues, on the binding free energy. It is shown that, in spite of small variations of the binding free energy with respect to the active site resolution, the separate contributions coming from different energetic terms (such as electrostatic and van der Waals interactions) manifest a stronger dependence on the mapping, thus pointing to the existence of an optimal level of intermediate resolution.

A new method for the construction of coarse-grained models of large biomolecules from low-resolution cryo-electron microscopy data

The rapid development of cryo-electron microscopy (cryo-EM) has led to the generation of significant low-resolution electron density data of biomolecules. However, the atomistic details of huge biomolecules usually cannot be obtained because it is very difficult to construct all-atom models for MD simulations. Thus, it is still a challenge to make use of the rich low-resolution cryo-EM data for computer simulation and functional study. In this study, we proposed a new method called Convolutional and K-means Coarse-Graining (CK-CG) for the efficient coarse-graining of large biological systems. Using the CK-CG method, we could directly map the cryo-EM data into coarse-grained (CG) beads. Furthermore, the CG beads were parameterized with an empirical harmonic potential to construct a new CG model. We subjected the CK-CG models of the fibrillar protein assemblies F-actin and collagen to external forces in pulling dynamic simulations to assess their mechanical response. The agreement between the estimated tensile stiffness between CG models and experiments demonstrates the validity of the CK-CG method. Thus, our method provides a practical strategy for the direct construction of a structural model from low-resolution data for biological function studies.

Computational Modeling of Realistic Cell Membranes

Cell membranes contain a large variety of lipid types and are crowded with proteins, endowing them with the plasticity needed to fulfill their key roles in cell functioning. The compositional complexity of cellular membranes gives rise to a heterogeneous lateral organization, which is still poorly understood. Computational models, in particular molecular dynamics simulations and related techniques, have provided important insight into the organizational principles of cell membranes over the past decades. Now, we are witnessing a transition from simulations of simpler membrane models to multicomponent systems, culminating in realistic models of an increasing variety of cell types and organelles. Here, we review the state of the art in the field of realistic membrane simulations and discuss the current limitations and challenges ahead.

A deep learning approach to the structural analysis of proteins

Deep learning (DL) algorithms hold great promise for applications in the field of computational biophysics. In fact, the vast amount of available molecular structures, as well as their notable complexity, constitutes an ideal context in which DL-based approaches can be profitably employed. To express the full potential of these techniques, though, it is a prerequisite to express the information contained in a molecule’s atomic positions and distances in a set of input quantities that the network can process. Many of the molecular descriptors devised so far are effective and manageable for relatively small structures, but become complex and cumbersome for larger ones. Furthermore, most of them are defined locally, a feature that could represent a limit for those applications where global properties are of interest. Here, we build a DL architecture capable of predicting non-trivial and intrinsically global quantities, that is, the eigenvalues of a protein’s lowest-energy fluctuation modes. This application represents a first, relatively simple test bed for the development of a neural network approach to the quantitative analysis of protein structures, and demonstrates unexpected use in the identification of mechanically relevant regions of the molecule.

Backmapping from Multiresolution Coarse-Grained Models to Atomic Structures of Large Biomolecules by Restrained Molecular Dynamics Simulations Using Bayesian Inference

Coarse-grained (CG) simulations have allowed access to larger length scales and longer time scales in the study of the dynamic processes of large biomolecules than all-atom (AA) molecular dynamics (MD) simulations. Backmapping from CG models to AA structures has long been studied because it enables us to gain detailed structure insights from CG simulations. Many methods first construct an AA structure from the CG model by fragments, random placement, or geometrical rules and subsequently optimize the solution via energy minimization, simulated annealing or position-restrained simulations. However, such methods may only work well on residue-level CG models and cannot consider the deviations of CG models. In this work, we describe, to the best of our knowledge, a new backmapping method based on Bayesian inference and restrained MD simulations. Restraints with log harmonic energy terms are defined according to the target CG model using the Bayesian inference in which the CG deviations can be estimated. From an initial AA structure obtained from either high-resolution experiments or homology modeling, a MD simulation with the aforementioned restraints is performed to obtain a final AA structure that is a backmapping of the target CG model. The method was validated using multiresolution CG models of the soluble extracellular region of the human epidermal growth factor receptor and was further applied to construct AA structures from CG simulations of the nucleosome core particle. The results demonstrate that our method can generate accurate AA structures of different types of biomolecules from multiple CG models with either residue-level resolution or much lower resolution than one-site-per-residue.

Optimizing model representation for integrative structure determination of macromolecular assemblies

Integrative structure determination of macromolecular assemblies requires specifying the representation of the modeled structure, a scoring function for ranking alternative models based on diverse types of data, and a sampling method for generating these models. Structures are often represented at atomic resolution, although ad hoc simplified representations based on generic guidelines and/or trial and error are also used. In contrast, we introduce here the concept of optimizing representation. To illustrate this concept, the optimal representation is selected from a set of candidate representations based on an objective criterion that depends on varying amounts of information available for different parts of the structure. Specifically, an optimal representation is defined as the highest-resolution representation for which sampling is exhaustive at a precision commensurate with the precision of the representation. Thus, the method does not require an input structure and is applicable to any input information. We consider a space of representations in which a representation is a set of nonoverlapping, variable-length segments (i.e., coarse-grained beads) for each component protein sequence. We also implement a method for efficiently finding an optimal representation in our open-source Integrative Modeling Platform (IMP) software (https://integrativemodeling.org/). The approach is illustrated by application to three complexes of two subunits and a large assembly of 10 subunits. The optimized representation facilitates exhaustive sampling and thus can produce a more accurate model and a more accurate estimate of its uncertainty for larger structures than were possible previously.

Multiscale Modeling and Simulation Approaches to Lipid-Protein Interactions

Lipid membranes play a crucial role in living systems by compartmentalizing biological processes and forming a barrier between these processes and the environment. Naturally, a large apparatus of biomolecules is responsible for construction, maintenance, transport, and degradation of these lipid barriers. Additional classes of biomolecules are tasked with transport of specific substances or transduction of signals from the environment across lipid membranes. In this article, we intend to describe a set of techniques that enable one to build accurate models of lipid systems and their associated proteins, and to simulate their dynamics over a variety of time and length scales. We discuss the methods and challenges that allow us to derive structural, mechanistic, and thermodynamic information from these models. We also show how these models have recently been applied in research to study some of the most complex lipid-protein systems to date, including bacterial and viral envelopes, neuronal membranes, and mammalian signaling systems.

Graph-Based Approach to Systematic Molecular Coarse-Graining

A novel methodology is introduced here to generate coarse-grained (CG) representations of molecular models for simulations. The proposed strategy relies on basic graph-theoretic principles and is referred to as graph-based coarse-graining (GBCG). It treats a given system as a molecular graph and derives a corresponding CG representation by using edge contractions to combine nodes in the graph, which correspond to atoms in the molecule, into CG sites. A key element of this methodology is that the nodes are combined according to well-defined protocols that rank-order nodes based on the underlying chemical connectivity. By iteratively performing these operations, successively coarser representations of the original atomic system can be produced to yield a systematic set of CG mappings with hierarchical resolution in an automated fashion. These capabilities are demonstrated in the context of several test systems, including toluene, pentadecane, a polysaccharide dimer, and a rhodopsin protein. In these examples, GBCG yields multiple, intuitive structures that naturally preserve the chemical topology of the system. Importantly, these representations are rendered from algorithmic implementation rather than an arbitrary ansatz, which, until now, has been the conventional approach for defining CG mapping schemes. Overall, the results presented here indicate that GBCG is efficient, robust, and unambiguous in its application, making it a valuable tool for future CG modeling.

Optimal Coarse-Grained Site Selection in Elastic Network Models of Biomolecules

Elastic network models, simple structure-based representations of biomolecules where atoms interact via short-range harmonic potentials, provide great insight into a molecule's internal dynamics and mechanical properties at extremely low computational cost. Their efficiency and effectiveness have made them a pivotal instrument in the computer-aided study of proteins and, since a few years, also of nucleic acids. In general, the coarse-grained sites, i.e. those effective force centers onto which the all-atom structure is mapped, are constructed based on intuitive rules: a typical choice for proteins is to retain only the C _α atoms of each amino acid. However, a mapping strategy relying only on the atom type and not the local properties of its embedding can be suboptimal compared to a more careful selection. Here, we present a strategy in which the subset of atoms, each of which is mapped onto a unique coarse-grained site of the model, is selected in a stochastic search aimed at optimizing a cost function. The latter is taken to be a simple measure of the consistency between the harmonic approximation of an elastic network model and the harmonic model obtained through exact integration of the discarded degrees of freedom. The method is applied to two representatives of structurally very different types of biomolecules: the protein adenylate kinase and the RNA molecule adenine riboswitch. Our analysis quantifies the substantial impact that an algorithm-driven selection of coarse-grained sites can have on a model's properties.

Coarse-Grained Model for Zippering of SNARE from Partially Assembled States

Neuronal transmitters are released from nerve terminals via the fusion of synaptic vesicles with the presynaptic membrane. Vesicles are attached to the membrane via the SNARE complex, comprising the vesicle associated protein synaptobrevin (Syb), the membrane associated protein syntaxin (Syx), and the cytosolic protein SNAP25, that together form a four-helical bundle. The full assembly of Syb onto the core SNARE bundle promotes vesicle fusion. We investigated SNARE assembly using a coarse-grained model of the SNARE complex that retains chemical specificity. Steered force-control simulations of SNARE unzippering were used to set up initial disassembled states of the SNARE complex. From these states, the assembly process was simulated. We find that if Syb is in helical form and proximal to the other helices, then the SNARE complex assembles rapidly, on a microsecond time-scale, which is well within in vivo synaptic vesicle fusion time scales. Assembly times grow exponentially with a separation distance between Syb and Syx C-termini. Our results indicate that for biologically relevant rapid assembly of the SNARE complex, Syb should be in helical form, and the SNARE constituent helices brought into proximity, possibly by an agent, such as a chaperone.

Encoding and selecting coarse-grain mapping operators with hierarchical graphs

Coarse-grained (CG) molecular dynamics (MD) can simulate systems inaccessible to fine-grained (FG) MD simulations. A CG simulation decreases the degrees of freedom by mapping atoms from an FG representation into agglomerate CG particles. The FG to CG mapping is not unique. Research into systematic selection of these mappings is challenging due to their combinatorial growth with respect to the number of atoms in a molecule. Here we present a method of reducing the total count of mappings by imposing molecular topology and symmetry constraints. The count reduction is illustrated by considering all mappings for nearly 50 000 molecules. The resulting number of mapping operators is still large, so we introduce a novel hierarchical graphical approach which encodes multiple CG mapping operators. The encoding method is demonstrated for methanol and a 14-mer peptide. With the test cases, we show how the encoding can be used for automated selection of reasonable CG mapping operators.

Quantum theory of multiscale coarse-graining

Coarse-grained (CG) models serve as a powerful tool to simulate molecular systems at much longer temporal and spatial scales. Previously, CG models and methods have been built upon classical statistical mechanics. The present paper develops a theory and numerical methodology for coarse-graining in quantum statistical mechanics, by generalizing the multiscale coarse-graining (MS-CG) method to quantum Boltzmann statistics. A rigorous derivation of the sufficient thermodynamic consistency condition is first presented via imaginary time Feynman path integrals. It identifies the optimal choice of CG action functional and effective quantum CG (qCG) force field to generate a quantum MS-CG (qMS-CG) description of the equilibrium system that is consistent with the quantum fine-grained model projected onto the CG variables. A variational principle then provides a class of algorithms for optimally approximating the qMS-CG force fields. Specifically, a variational method based on force matching, which was also adopted in the classical MS-CG theory, is generalized to quantum Boltzmann statistics. The qMS-CG numerical algorithms and practical issues in implementing this variational minimization procedure are also discussed. Then, two numerical examples are presented to demonstrate the method. Finally, as an alternative strategy, a quasi-classical approximation for the thermal density matrix expressed in the CG variables is derived. This approach provides an interesting physical picture for coarse-graining in quantum Boltzmann statistical mechanics in which the consistency with the quantum particle delocalization is obviously manifest, and it opens up an avenue for using path integral centroid-based effective classical force fields in a coarse-graining methodology.

Structure and Relaxation in Solutions of Monoclonal Antibodies

Reversible self-association of therapeutic antibodies is a key factor in high protein solution viscosities. In the present work, a coarse-grained computational model accounting for electrostatic, dispersion, and long-ranged hydrodynamic interactions of two model monoclonal antibodies is applied to understand the nature of self-association, predicting the solution microstructure and resulting transport properties of the solution. For the proteins investigated, the structure factor across a range of solution conditions shows quantitative agreement with neutron-scattering experiments. We observe a homogeneous, dynamical association of the antibodies with no evidence of phase separation. Calculations of self-diffusivity and viscosity from coarse-grained dynamic simulations show the appropriate trends with concentration but, respectively, over- and under-predict the experimentally measured values. By adding constraints to the self-associated clusters that rigidify them under flow, prediction of the transport properties is significantly improved with respect to experimental measurements. We hypothesize that these rigidity constraints are associated with missing degrees of freedom in the coarse-grained model resulting from patchy and heterogeneous interactions among coarse-grained domains. These results demonstrate how structural anisotropy and anisotropy of interactions generated by features at the 2-5 nm length scale in antibodies are sufficient to recover the dynamics and rheological properties of these important macromolecular solutions.

Modeling Functional Motions of Biological Systems by Customized Natural Moves

Simulating the functional motions of biomolecular systems requires large computational resources. We introduce a computationally inexpensive protocol for the systematic testing of hypotheses regarding the dynamic behavior of proteins and nucleic acids. The protocol is based on natural move Monte Carlo, a highly efficient conformational sampling method with built-in customization capabilities that allows researchers to design and perform a large number of simulations to investigate functional motions in biological systems. We demonstrate the use of this protocol on both a protein and a DNA case study. Firstly, we investigate the plasticity of a class II major histocompatibility complex in the absence of a bound peptide. Secondly, we study the effects of the epigenetic mark 5-hydroxymethyl on cytosine on the structure of the Dickerson-Drew dodecamer. We show how our customized natural moves protocol can be used to investigate causal relationships of functional motions in biological systems.

Highly Coarse-Grained Representations of Transmembrane Proteins

Numerous biomolecules and biomolecular complexes, including transmembrane proteins (TMPs), are symmetric or at least have approximate symmetries. Highly coarse-grained models of such biomolecules, aiming at capturing the essential structural and dynamical properties on resolution levels coarser than the residue scale, must preserve the underlying symmetry. However, making these models obey the correct physics is in general not straightforward, especially at the highly coarse-grained resolution where multiple (∼3-30 in the current study) amino acid residues are represented by a single coarse-grained site. In this paper, we propose a simple and fast method of coarse-graining TMPs obeying this condition. The procedure involves partitioning transmembrane domains into contiguous segments of equal length along the primary sequence. For the coarsest (lowest-resolution) mappings, it turns out to be most important to satisfy the symmetry in a coarse-grained model. As the resolution is increased to capture more detail, however, it becomes gradually more important to match modular repeats in the secondary structure (such as helix-loop repeats) instead. A set of eight TMPs of various complexity, functionality, structural topology, and internal symmetry, representing different classes of TMPs (ion channels, transporters, receptors, adhesion, and invasion proteins), has been examined. The present approach can be generalized to other systems possessing exact or approximate symmetry, allowing for reliable and fast creation of multiscale, highly coarse-grained mappings of large biomolecular assemblies.

Performance Comparison of Systematic Methods for Rigorous Definition of Coarse-Grained Sites of Large Biomolecules

Construction of coarse-grained (CG) models for large biomolecules used for multiscale simulations demands a rigorous definition of CG sites for them. Several coarse-graining methods such as the simulated annealing and steepest descent (SASD) based on the essential dynamics coarse-graining (ED-CG) or the stepwise local iterative optimization (SLIO) based on the fluctuation maximization coarse-graining (FM-CG), were developed to do it. However, the practical applications of these methods such as SASD based on ED-CG are subject to limitations because they are too expensive. In this work, we extend the applicability of ED-CG by combining it with the SLIO algorithm. A comprehensive comparison of optimized results and accuracy of various algorithms based on ED-CG show that SLIO is the fastest as well as the most accurate algorithm among them. ED-CG combined with SLIO could give converged results as the number of CG sites increases, which demonstrates that it is another efficient method for coarse-graining large biomolecules. The construction of CG sites for Ras protein by using MD fluctuations demonstrates that the CG sites derived from FM-CG can reflect the fluctuation properties of secondary structures in Ras accurately.

Steric exclusion and constraint satisfaction in multi-scale coarse-grained simulations

•

The method developed here provides a fast and flexible way to capture the structure of most macromolecules in a hierarchy of increasingly larger coarse-grained levels without losing the detailed low-level representation.

•

Molecules can then be viewed using an integral graphical viewer or animated through a high-level application programming interface (API) in C++.

•

Although much testing remains to be done, the system has the potential to be applied to very large dynamic systems including both protein and nucleic acids.

An algorithm is described for the interaction of a hierarchy of objects that seeks to circumvent a fundamental problem in coarse-grained modelling which is the loss of fine detail when components become bundled together. A “currants-in-jelly” model is developed that provides a flexible approach in which the contribution of the soft high-level objects (jelly-like) are employed to protect the underlying atomic structure (currants), while still allowing them to interact. Idealised chains were used to establish the parameters to achieve this degree of interaction over a hierarchy spanning four levels and in a more realistic example, the distortion experienced by a protein domain structure during collision was measured and the parameters refined. This model of steric repulsion was then combined with sets of predicted distance constraints, derived from correlated mutation analysis. Firstly, an integral trans-membrane protein was modelled in which the packing of the seven helices was refined but without topological rearrangement. Secondly, an RNA structure was ‘folded’ under the predicted constraints, starting only from its 2-dimensional secondary structure prediction.

The multiscale coarse-graining method. XI. Accurate interactions based on the centers of charge of coarse-grained sites

It is essential to be able to systematically construct coarse-grained (CG) models that can efficiently and accurately reproduce key properties of higher-resolution models such as all-atom. To fulfill this goal, a mapping operator is needed to transform the higher-resolution configuration to a CG configuration. Certain mapping operators, however, may lose information related to the underlying electrostatic properties. In this paper, a new mapping operator based on the centers of charge of CG sites is proposed to address this issue. Four example systems are chosen to demonstrate this concept. Within the multiscale coarse-graining framework, CG models that use this mapping operator are found to better reproduce the structural correlations of atomistic models. The present work also demonstrates the flexibility of the mapping operator and the robustness of the force matching method. For instance, important functional groups can be isolated and emphasized in the CG model.

The impact of resolution upon entropy and information in coarse-grained models

By eliminating unnecessary degrees of freedom, coarse-grained (CG) models tremendously facilitate numerical calculations and theoretical analyses of complex phenomena. However, their success critically depends upon the representation of the system and the effective potential that governs the CG degrees of freedom. This work investigates the relationship between the CG representation and the many-body potential of mean force (PMF), W, which is the appropriate effective potential for a CG model that exactly preserves the structural and thermodynamic properties of a given high resolution model. In particular, we investigate the entropic component of the PMF and its dependence upon the CG resolution. This entropic component, SW, is a configuration-dependent relative entropy that determines the temperature dependence of W. As a direct consequence of eliminating high resolution details from the CG model, the coarsening process transfers configurational entropy and information from the configuration space into SW. In order to further investigate these general results, we consider the popular Gaussian Network Model (GNM) for protein conformational fluctuations. We analytically derive the exact PMF for the GNM as a function of the CG representation. In the case of the GNM, -TSW is a positive, configuration-independent term that depends upon the temperature, the complexity of the protein interaction network, and the details of the CG representation. This entropic term demonstrates similar behavior for seven model proteins and also suggests, in each case, that certain resolutions provide a more efficient description of protein fluctuations. These results may provide general insight into the role of resolution for determining the information content, thermodynamic properties, and transferability of CG models. Ultimately, they may lead to a rigorous and systematic framework for optimizing the representation of CG models.

Constructing Optimal Coarse-Grained Sites of Huge Biomolecules by Fluctuation Maximization

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.

Interaction of peptides with cell membranes: insights from molecular modeling

The investigation of the interaction of peptides with cell membranes is the focus of active research. It can enhance the understanding of basic membrane functions such as membrane transport, fusion, and signaling processes, and it may shed light on potential applications of peptides in biomedicine. In this review, we will present current advances in computational studies on the interaction of different types of peptides with the cell membrane. Depending on the properties of the peptide, membrane, and external environment, the peptide-membrane interaction shows a variety of different forms. Here, on the basis of recent computational progress, we will discuss how different peptides could initiate membrane pores, translocate across the membrane, induce membrane endocytosis, produce membrane curvature, form fibrils on the membrane surface, as well as interact with functional membrane proteins. Finally, we will present a conclusion summarizing recent progress and providing some specific insights into future developments in this field.

Coarse-Grained Model of SNARE-Mediated Docking

Synaptic transmission requires that vesicles filled with neurotransmitter molecules be docked to the plasma membrane by the SNARE protein complex. The SNARE complex applies attractive forces to overcome the long-range repulsion between the vesicle and membrane. To understand how the balance between the attractive and repulsive forces defines the equilibrium docked state we have developed a model that combines the mechanics of vesicle/membrane deformation with an apparently new coarse-grained model of the SNARE complex. The coarse-grained model of the SNARE complex is calibrated by comparison with all-atom molecular dynamics simulations as well as by force measurements in laser tweezer experiments. The model for vesicle/membrane interactions includes the forces produced by membrane deformation and hydration or electrostatic repulsion. Combining these two parts, the coarse-grained model of the SNARE complex with membrane mechanics, we study how the equilibrium docked state varies with the number of SNARE complexes. We find that a single SNARE complex is able to bring a typical synaptic vesicle to within a distance of ∼ 3 nm from the membrane. Further addition of SNARE complexes shortens this distance, but an overdocked state of >4-6 SNAREs actually increases the equilibrium distance.

ResiCon: a method for the identification of dynamic domains, hinges and interfacial regions in proteins

MOTIVATION

Structure of most proteins is flexible. Identification and analysis of intramolecular motions is a complex problem. Breaking a structure into relatively rigid parts, the so-called dynamic domains, may help comprehend the complexity of protein's mobility. We propose a new approach called ResiCon (Residue Contacts analysis), which performs this task by applying a data-mining analysis of an ensemble of protein configurations and recognizes dynamic domains, hinges and interfacial regions, by considering contacts between residues.

RESULTS

Dynamic domains found by ResiCon are more compact than those identified by two other popular methods: PiSQRD and GeoStaS. The current analysis was carried out using a known reference set of 30 NMR protein structures, as well as molecular dynamics simulation data of flap opening events in HIV-1 protease. The more detailed analysis of HIV-1 protease dataset shows that ResiCon identified dynamic domains involved in structural changes of functional importance.

AVAILABILITY AND IMPLEMENTATION

The ResiCon server is available at URL: http://dworkowa.imdik.pan.pl/EP/ResiCon.

CONTACT

pawel@bioexploratorium.pl

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

A new algorithm for construction of coarse-grained sites of large biomolecules

The development of coarse-grained (CG) models for large biomolecules remains a challenge in multiscale simulations, including a rigorous definition of CG representations for them. In this work, we proposed a new stepwise optimization imposed with the boundary-constraint (SOBC) algorithm to construct the CG sites of large biomolecules, based on the s cheme of essential dynamics CG. By means of SOBC, we can rigorously derive the CG representations of biomolecules with less computational cost. The SOBC is particularly efficient for the CG definition of large systems with thousands of residues. The resulted CG sites can be parameterized as a CG model using the normal mode analysis based fluctuation matching method. Through normal mode analysis, the obtained modes of CG model can accurately reflect the functionally related slow motions of biomolecules. The SOBC algorithm can be used for the construction of CG sites of large biomolecules such as F-actin and for the study of mechanical properties of biomaterials.

Bridging between NMA and Elastic Network Models: Preserving All-Atom Accuracy in Coarse-Grained Models

Dynamics can provide deep insights into the functional mechanisms of proteins and protein complexes. For large protein complexes such as GroEL/GroES with more than 8,000 residues, obtaining a fine-grained all-atom description of its normal mode motions can be computationally prohibitive and is often unnecessary. For this reason, coarse-grained models have been used successfully. However, most existing coarse-grained models use extremely simple potentials to represent the interactions within the coarse-grained structures and as a result, the dynamics obtained for the coarse-grained structures may not always be fully realistic. There is a gap between the quality of the dynamics of the coarse-grained structures given by all-atom models and that by coarse-grained models. In this work, we resolve an important question in protein dynamics computations—how can we efficiently construct coarse-grained models whose description of the dynamics of the coarse-grained structures remains as accurate as that given by all-atom models? Our method takes advantage of the sparseness of the Hessian matrix and achieves a high efficiency with a novel iterative matrix projection approach. The result is highly significant since it can provide descriptions of normal mode motions at an all-atom level of accuracy even for the largest biomolecular complexes. The application of our method to GroEL/GroES offers new insights into the mechanism of this biologically important chaperonin, such as that the conformational transitions of this protein complex in its functional cycle are even more strongly connected to the first few lowest frequency modes than with other coarse-grained models.

Proteins and other biomolecules are not static but are constantly in motion. Moreover, they possess intrinsic collective motion patterns that are tightly linked to their functions. Thus, an accurate and detailed description of their motions can provide deep insights into their functional mechanisms. For large protein complexes with hundreds of thousands of atoms or more, an atomic level description of the motions can be computationally prohibitive, and so coarse-grained models with fewer structural details are often used instead. However, there can be a big gap between the quality of motions derived from atomic models and those from coarse-grained models. In this work, we solve an important problem in protein dynamics studies: how to preserve the atomic-level accuracy in describing molecular motions while using coarse-grained models? We accomplish this by developing a novel iterative matrix projection method that dramatically speeds up the computations. This method is significant since it promises accurate descriptions of protein motions approaching an all-atom level even for the largest biomolecular complexes. Results shown here for a large molecular chaperonin demonstrate how this can provide new insights into its functional process.

Sequence, structure, and cooperativity in folding of elementary protein structural motifs

Residue-level unfolding of two helix-turn-helix proteins--one naturally occurring and one de novo designed--is reconstructed from multiple sets of site-specific (13)C isotopically edited infrared (IR) and circular dichroism (CD) data using Ising-like statistical-mechanical models. Several model variants are parameterized to test the importance of sequence-specific interactions (approximated by Miyazawa-Jernigan statistical potentials), local structural flexibility (derived from the ensemble of NMR structures), interhelical hydrogen bonds, and native contacts separated by intervening disordered regions (through the Wako-Saitô-Muñoz-Eaton scheme, which disallows such configurations). The models are optimized by directly simulating experimental observables: CD ellipticity at 222 nm for model proteins and their fragments and (13)C-amide I' bands for multiple isotopologues of each protein. We find that data can be quantitatively reproduced by the model that allows two interacting segments flanking a disordered loop (double sequence approximation) and incorporates flexibility in the native contact maps, but neither sequence-specific interactions nor hydrogen bonds are required. The near-identical free energy profiles as a function of the global order parameter are consistent with expected similar folding kinetics for nearly identical structures. However, the predicted folding mechanism for the two motifs is different, reflecting the order of local stability. We introduce free energy profiles for "experimental" reaction coordinates--namely, the degree of local folding as sensed by site-specific (13)C-edited IR, which highlight folding heterogeneity and contrast its overall, average description with the detailed, local picture.

Systematic methods for defining coarse-grained maps in large biomolecules

Large biomolecules are involved in many important biological processes. It would be difficult to use large-scale atomistic molecular dynamics (MD) simulations to study the functional motions of these systems because of the computational expense. Therefore various coarse-grained (CG) approaches have attracted rapidly growing interest, which enable simulations of large biomolecules over longer effective timescales than all-atom MD simulations. The first issue in CG modeling is to construct CG maps from atomic structures. In this chapter, we review the recent development of a novel and systematic method for constructing CG representations of arbitrarily complex biomolecules, in order to preserve large-scale and functionally relevant essential dynamics (ED) at the CG level. In this ED-CG scheme, the essential dynamics can be characterized by principal component analysis (PCA) on a structural ensemble, or elastic network model (ENM) of a single atomic structure. Validation and applications of the method cover various biological systems, such as multi-domain proteins, protein complexes, and even biomolecular machines. The results demonstrate that the ED-CG method may serve as a very useful tool for identifying functional dynamics of large biomolecules at the CG level.

Coarse-graining poly(ethylene oxide)-poly(propylene oxide)-poly(ethylene oxide) (PEO-PPO-PEO) block copolymers using the MARTINI force field

The MARTINI coarse-grain (CG) force field is extended for a class of triblock block copolymers known as Pluronics. Existing MARTINI bead types are used to model the non-bonded part of the potential while single chain properties for both homopolymers, poly(ethylene oxide) (PEO) and poly(propylene oxide) (PPO), are used to develop the bonded interactions. The new set of force field parameters reproduces structural and dynamical properties of high molecular weight homo- and copolymers. The CG model is moderately transferable in solvents of different polarity and concentration; however, the PEO homopolymer model presents a reduced thermodynamic transferability especially in water probably due to the lack of hydrogen bonds with the solvent. Our simulations of a monolayer of Pluronic L44 show polymer-brush-like characteristics for the PEO segments which protrude into the aqueous phase. Other membrane properties not easily accessible using experimental techniques such as its membrane thickness are also calculated.