Dataset Information

Self-adaptive multiscaling algorithm for efficient simulations of many-protein systems in crowded conditions.

ABSTRACT: A method is described for the efficient simulation of multiprotein systems in crowded environments. It is based on an adaptive, reversible structural coarsening algorithm that preserves relevant physical features of the proteins across scales. Water is treated implicitly whereas all the other components of the aqueous solution, such as ions, cosolutes, or osmolytes, are treated in atomic detail. The focus is on the analytical adaptation of the solvent model to different levels of molecular resolutions, which allows continuous, on-the-fly transitions between scales. This permits the analytical calculation of forces during dynamics and preserves detailed balance in Monte Carlo simulations. A major computational speedup can be achieved in systems containing hundreds of proteins without cutting off the long-range interactions. The method can be combined with a self-adaptive configurational-bias sampling technique described previously, designed to detect strong, weak, or ultra-weak protein associations and shown to improve sampling efficiency and convergence. The implementation aims to simulate early stages of multimeric complexation, aggregation, or self-assembly. The method can be adopted as the basis for a more general algorithm to identify vertices, edges, and hubs in protein interaction networks or to predict critical steps in signal transduction pathways.

SUBMITTER: Hassan SA

PROVIDER: S-EPMC6752035 | biostudies-literature | 2018 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Self-adaptive multiscaling algorithm for efficient simulations of many-protein systems in crowded conditions.

Hassan Sergio A SA

Physical chemistry chemical physics : PCCP 20181101 45

A method is described for the efficient simulation of multiprotein systems in crowded environments. It is based on an adaptive, reversible structural coarsening algorithm that preserves relevant physical features of the proteins across scales. Water is treated implicitly whereas all the other components of the aqueous solution, such as ions, cosolutes, or osmolytes, are treated in atomic detail. The focus is on the analytical adaptation of the solvent model to different levels of molecular resol ...[more]

PMID: 30421760

Similar Datasets

Project description:A major computational challenge in the genomic era is annotating structure/function to the vast quantities of sequence information that is now available. This problem is illustrated by the fact that most proteins lack comprehensive annotations, even when experimental evidence exists. We previously theorized that embedded-alignment profiles (simply "alignment profiles" hereafter) provide a quantitative method that is capable of relating the structural and functional properties of proteins, as well as their evolutionary relationships. A key feature of alignment profiles lies in the interoperability of data format (e.g., alignment information, physio-chemical information, genomic information, etc.). Indeed, we have demonstrated that the Position Specific Scoring Matrices (PSSMs) are an informative M-dimension that is scored by quantitatively measuring the embedded or unmodified sequence alignments. Moreover, the information obtained from these alignments is informative, and remains so even in the "twilight zone" of sequence similarity (<25% identity). Although our previous embedding strategy was powerful, it suffered from contaminating alignments (embedded AND unmodified) and high computational costs. Herein, we describe the logic and algorithmic process for a heuristic embedding strategy named "Adaptive GDDA-BLAST." Adaptive GDDA-BLAST is, on average, up to 19 times faster than, but has similar sensitivity to our previous method. Further, data are provided to demonstrate the benefits of embedded-alignment measurements in terms of detecting structural homology in highly divergent protein sequences and isolating secondary structural elements of transmembrane and ankyrin-repeat domains. Together, these advances allow further exploration of the embedded alignment data space within sufficiently large data sets to eventually induce relevant statistical inferences. We show that sequence embedding could serve as one of the vehicles for measurement of low-identity alignments and for incorporation thereof into high-performance PSSM-based alignment profiles.

Project description:Large-scale analyses of protein-protein interactions based on coarse-grain molecular docking simulations and binding site predictions resulting from evolutionary sequence analysis, are possible and realizable on hundreds of proteins with variate structures and interfaces. We demonstrated this on the 168 proteins of the Mintseris Benchmark 2.0. On the one hand, we evaluated the quality of the interaction signal and the contribution of docking information compared to evolutionary information showing that the combination of the two improves partner identification. On the other hand, since protein interactions usually occur in crowded environments with several competing partners, we realized a thorough analysis of the interactions of proteins with true partners but also with non-partners to evaluate whether proteins in the environment, competing with the true partner, affect its identification. We found three populations of proteins: strongly competing, never competing, and interacting with different levels of strength. Populations and levels of strength are numerically characterized and provide a signature for the behavior of a protein in the crowded environment. We showed that partner identification, to some extent, does not depend on the competing partners present in the environment, that certain biochemical classes of proteins are intrinsically easier to analyze than others, and that small proteins are not more promiscuous than large ones. Our approach brings to light that the knowledge of the binding site can be used to reduce the high computational cost of docking simulations with no consequence in the quality of the results, demonstrating the possibility to apply coarse-grain docking to datasets made of thousands of proteins. Comparison with all available large-scale analyses aimed to partner predictions is realized. We release the complete decoys set issued by coarse-grain docking simulations of both true and false interacting partners, and their evolutionary sequence analysis leading to binding site predictions. Download site: http://www.lgm.upmc.fr/CCDMintseris/

Dataset Information

Self-adaptive multiscaling algorithm for efficient simulations of many-protein systems in crowded conditions.

Publications

Self-adaptive multiscaling algorithm for efficient simulations of many-protein systems in crowded conditions.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets