Stochastic dynamics of macromolecular-assembly networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Saiz L
PROVIDER: S-EPMC1681493 | biostudies-other | 2006
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Studies of the structure and dynamics of macromolecular assemblies often involve comparison of low resolution models obtained using different techniques such as electron microscopy or atomic force microscopy. We present new computational tools for comparing (matching) and docking of low resolution structures, based on shape complementarity. The matched or docked objects are represented by three dimensional grids where the value of each grid point depends on its position with regard to the interior, surface or exterior of the object. The grids are correlated using fast Fourier transformations producing either matches of related objects or docking models depending on the details of the grid representations. The procedures incorporate thickening and smoothing of the surfaces of the objects which effectively compensates for differences in the resolution of the matched/docked objects, circumventing the need for resolution modification. The presented matching tool FitEM2EMin successfully fitted electron microscopy structures obtained at different resolutions, different conformers of the same structure and partial structures, ranking correct matches at the top in every case. The differences between the grid representations of the matched objects can be used to study conformation differences or to characterize the size and shape of substructures. The presented low-to-low docking tool FitEM2EMout ranked the expected models at the top.
| S-EPMC2572833 | biostudies-literature
Project description:The presence of protein-DNA binding reactions often leads to analytically intractable models of stochastic gene expression. Here we present the linear-mapping approximation that maps systems with protein-promoter interactions onto approximately equivalent systems with no binding reactions. This is achieved by the marriage of conditional mean-field approximation and the Magnus expansion, leading to analytic or semi-analytic expressions for the approximate time-dependent and steady-state protein number distributions. Stochastic simulations verify the method's accuracy in capturing the changes in the protein number distributions with time for a wide variety of networks displaying auto- and mutual-regulation of gene expression and independently of the ratios of the timescales governing the dynamics. The method is also used to study the first-passage time distribution of promoter switching, the sensitivity of the size of protein number fluctuations to parameter perturbation and the stochastic bifurcation diagram characterizing the onset of multimodality in protein number distributions.
| S-EPMC6098115 | biostudies-literature
Project description:UnlabelledBackgroundIn order to replicate within their cellular host, many viruses have developed self-assembly strategies for their capsids which are sufficiently robust as to be reconstituted in vitro. Mathematical models for virus self-assembly usually assume that the bonds leading to cluster formation have constant reactivity over the time course of assembly (direct assembly). In some cases, however, binding sites between the capsomers have been reported to be activated during the self-assembly process (hierarchical assembly).ResultsIn order to study possible advantages of such hierarchical schemes for icosahedral virus capsid assembly, we use Brownian dynamics simulations of a patchy particle model that allows us to switch binding sites on and off during assembly. For T1 viruses, we implement a hierarchical assembly scheme where inter-capsomer bonds become active only if a complete pentamer has been assembled. We find direct assembly to be favorable for reversible bonds allowing for repeated structural reorganizations, while hierarchical assembly is favorable for strong bonds with small dissociation rate, as this situation is less prone to kinetic trapping. However, at the same time it is more vulnerable to monomer starvation during the final phase. Increasing the number of initial monomers does have only a weak effect on these general features. The differences between the two assembly schemes become more pronounced for more complex virus geometries, as shown here for T3 viruses, which assemble through homogeneous pentamers and heterogeneous hexamers in the hierarchical scheme. In order to complement the simulations for this more complicated case, we introduce a master equation approach that agrees well with the simulation results.ConclusionsOur analysis shows for which molecular parameters hierarchical assembly schemes can outperform direct ones and suggests that viruses with high bond stability might prefer hierarchical assembly schemes. These insights increase our physical understanding of an essential biological process, with many interesting potential applications in medicine and materials science.
| S-EPMC3563543 | biostudies-literature
Project description:BACKGROUND: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim at describing the cell interactome. These data are usually presented as graphs where proteins (nodes) are linked by edges to their experimentally determined partners. This representation reveals that protein-protein interaction (PPI) networks, like other kinds of complex networks, are not randomly organized and display properties that are typical of "hierarchical" networks, combining modularity and local clustering to scale free topology. However informative, this representation is static and provides no clue about the dynamic nature of protein interactions inside the cell. RESULTS: To fill this methodological gap, we designed and implemented a computer model that captures the discrete and stochastic nature of protein interactions. In ProtNet, our simplified model, the intracellular space is mapped onto either a two-dimensional or a three-dimensional lattice with each lattice site having a linear size (5 nm) comparable to the diameter of an average globular protein. The protein filled lattice has an occupancy (e.g. 20%) compatible with the estimated crowding of proteins in the cell cytoplasm. Proteins or protein complexes are free to translate and rotate on the lattice that represents a sort of naïve unstructured cell (devoid of compartments). At each time step, molecular entities (proteins or complexes) that happen to be in neighboring cells may interact and form larger complexes or dissociate depending on the interaction rules defined in an experimental protein interaction network. This whole procedure can be seen as a sort of "discrete molecular dynamics" applied to interacting proteins in a cell. We have tested our model by performing different simulations using as interaction rules those derived from an experimental interactome of Saccharomyces cerevisiae (1378 nodes, 2491 edges) and we have compared the dynamics of complex formation in a two and a three dimensional lattice model. CONCLUSION: ProtNet is a cellular automaton model, where each protein molecule or complex is explicitly represented and where simple interaction rules are applied to populations of discrete particles. This tool can be used to simulate the dynamics of protein interactions in the cell.
| S-EPMC1885856 | biostudies-other
Project description:Proteins in solution are conventionally considered macromolecules. Dynamic microscopic structures in supersaturated protein solutions have received increasing attention in the study of protein crystallisation and the formation of misfolded aggregates. Here, we present a method for observing rotational dynamic structures that can detect the interaction of nanoscale lysozyme protein networks via diffracted X-ray tracking (DXT). Our DXT analysis demonstrated that the rearrangement behaviours of lysozyme networks or clusters, which are driven by local density and concentration fluctuations, generate force fields on the femtonewton to attonewton (fN - aN) scale. This quantitative parameter was previously observed in our experiments on supersaturated inorganic solutions. This commonality provides a way to clarify the solution structures of a variety of supersaturated solutions as well as to control nucleation and crystallisation in supersaturated solutions.
| S-EPMC5665898 | biostudies-literature
Project description:Nature constructs intricate complexes containing numerous binding partners in order to direct a variety of cellular processes. Researchers have taken a cue from these events to develop synthetic molecules that can nucleate natural and unnatural interactions for a diverse set of applications. These molecules can be designed to drive protein dimerization or to modulate the interactions between proteins, lipids, DNA, or RNA and thereby alter cellular pathways. A variety of components within the cellular machinery can be recruited with or replaced by synthetic compounds. Directing the formation of multicomponent complexes with new synthetic molecules can allow unprecedented control over the cellular machinery.
| S-EPMC4176617 | biostudies-literature
Project description:Modeling of macromolecular structures involves structural sampling guided by a scoring function, resulting in an ensemble of good-scoring models. By necessity, the sampling is often stochastic, and must be exhaustive at a precision sufficient for accurate modeling and assessment of model uncertainty. Therefore, the very first step in analyzing the ensemble is an estimation of the highest precision at which the sampling is exhaustive. Here, we present an objective and automated method for this task. As a proxy for sampling exhaustiveness, we evaluate whether two independently and stochastically generated sets of models are sufficiently similar. The protocol includes testing 1) convergence of the model score, 2) whether model scores for the two samples were drawn from the same parent distribution, 3) whether each structural cluster includes models from each sample proportionally to its size, and 4) whether there is sufficient structural similarity between the two model samples in each cluster. The evaluation also provides the sampling precision, defined as the smallest clustering threshold that satisfies the third, most stringent test. We validate the protocol with the aid of enumerated good-scoring models for five illustrative cases of binary protein complexes. Passing the proposed four tests is necessary, but not sufficient for thorough sampling. The protocol is general in nature and can be applied to the stochastic sampling of any set of models, not just structural models. In addition, the tests can be used to stop stochastic sampling as soon as exhaustiveness at desired precision is reached, thereby improving sampling efficiency; they may also help in selecting a model representation that is sufficiently detailed to be informative, yet also sufficiently coarse for sampling to be exhaustive.
| S-EPMC5768525 | biostudies-literature
Project description:Many chemical reaction networks in biological systems present complex oscillatory dynamics. In systems such as regulatory gene networks, cell cycle, and enzymatic processes, the number of molecules involved is often far from the thermodynamic limit. Although stochastic models based on the probabilistic approach of the Chemical Master Equation (CME) have been proposed, studies in the literature have been limited by the challenges of solving the CME and the lack of computational power to perform large-scale stochastic simulations. In this paper, we show that the infinite set of stationary moment equations describing the stochastic Brusselator and Schnakenberg oscillatory reactions networks can be truncated and solved using maximization of the entropy of the distributions. The results from our numerical experiments compare with the distributions obtained from well-established kinetic Monte Carlo methods and suggest that the accuracy of the prediction increases exponentially with the closure order chosen for the system. We conclude that maximum entropy models can be used as an efficient closure scheme alternative for moment equations to predict the non-equilibrium stationary distributions of stochastic chemical reactions with oscillatory dynamics. This prediction is accomplished without any prior knowledge of the system dynamics and without imposing any biased assumptions on the mathematical relations among species involved.
| S-EPMC6424531 | biostudies-literature
Project description:The structures of biological macromolecules would not be known to their present extent without X-ray crystallography. Most simulations of globular proteins in solution begin by surrounding the crystal structure of the monomer in a bath of water molecules, but the standard simulation employing periodic boundary conditions is already close to a crystal lattice environment. With simple protocols, the same software and molecular models can perform simulations of the crystal lattice, including all asymmetric units and solvent to fill the box. Throughout the history of molecular dynamics, studies of crystal lattices have served to investigate the quality of the underlying force fields, correlate the simulated ensembles to experimental structure factors, and extrapolate the behavior in lattices to behavior in solution. Powerful new computers are enabling molecular simulations with greater realism and statistical convergence. Meanwhile, the advent of exciting new methods in crystallography, including femtosecond free-electron lasers and image reconstruction for time-resolved crystallography on slurries of small crystals, is expanding the range of structures accessible to X-ray diffraction. We review past fusions of simulations and crystallography, then look ahead to the ways that simulations of crystal structures will enhance structural biology in the future.
| S-EPMC6818516 | biostudies-literature
Project description:Network motifs have been identified in a wide range of networks across many scientific disciplines and are suggested to be the basic building blocks of most complex networks. Nonetheless, many networks come with intrinsic and/or experimental uncertainties and should be treated as stochastic networks. The building blocks in these networks thus may also have stochastic properties. In this article, we study stochastic network motifs derived from families of mutually similar but not necessarily identical patterns of interconnections. We establish a finite mixture model for stochastic networks and develop an expectation-maximization algorithm for identifying stochastic network motifs. We apply this approach to the transcriptional regulatory networks of Escherichia coli and Saccharomyces cerevisiae, as well as the protein-protein interaction networks of seven species, and identify several stochastic network motifs that are consistent with current biological knowledge.
| S-EPMC1480420 | biostudies-literature