A hybrid multiscale Monte Carlo algorithm (HyMSMC) to cope with disparity in time scales and species populations in intracellular networks

Background  

The fundamental role that intrinsic stochasticity plays in cellular functions has been shown via numerous computational and experimental studies. In the face of such evidence, it is important that intracellular networks are simulated with stochastic algorithms that can capture molecular fluctuations. However, separation of time scales and disparity in species population, two common features of intracellular networks, make stochastic simulation of such networks computationally prohibitive. While recent work has addressed each of these challenges separately, a generic algorithm that can simultaneously tackle disparity in time scales and population scales in stochastic systems is currently lacking. In this paper, we propose the hybrid, multiscale Monte Carlo (HyMSMC) method that fills in this void.     

Stochastic Simulation of Biomolecular Networks in Dynamic Environments

Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate—using decision-making by a large population of quorum sensing bacteria—that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits.     

Angiogenesis: An Adaptive Dynamic Biological Patterning Problem

Formation of functionally adequate vascular networks by angiogenesis presents a problem in biological patterning. Generated without predetermined spatial patterns, networks must develop hierarchical tree-like structures for efficient convective transport over large distances, combined with dense space-filling meshes for short diffusion distances to every point in the tissue. Moreover, networks must be capable of restructuring in response to changing functional demands without interruption of blood flow. Here, theoretical simulations based on experimental data are used to demonstrate that this patterning problem can be solved through over-abundant stochastic generation of vessels in response to a growth factor generated in hypoxic tissue regions, in parallel with refinement by structural adaptation and pruning. Essential biological mechanisms for generation of adequate and efficient vascular patterns are identified and impairments in vascular properties resulting from defects in these mechanisms are predicted. The results provide a framework for understanding vascular network formation in normal or pathological conditions and for predicting effects of therapies targeting angiogenesis.     

Qualitative modeling of normal blood coagulation and its pathological states using stochastic activity networks

We have developed a method for representing biological pathways and simulating their behavior based on the use of stochastic activity networks (SANs). SANs, an extension of the original Petri net, have been used traditionally to model flow systems including data-communications networks and manufacturing processes. We apply the methodology to the blood coagulation cascade, a biological flow system, and present the representation method as well as results of simulation studies based on published experimental data. In addition to describing the dynamic model, we also present the results of its utilization to perform simulations of clinical states including hemophilia's A and B as well as sensitivity analysis of individual factors and their impact on thrombin production.     

Stop competing,start talking!

According to current belief, the molecular networks orchestrating cell death or exit from mitosis upon extended mitotic arrest do not interact, stubbornly executing two parallel biological programs and competing to define a stochastic decision between death and a chance for survival with uncertain destiny. However, recent findings by Diaz‐Martinez et al ( 2014 ) in this issue of The EMBO Journal now call for a reassessment of the “competing network” hypothesis.     

Smoldyn on graphics processing units: massively parallel Brownian dynamics simulations

Space is a very important aspect in the simulation of biochemical systems; recently, the need for simulation algorithms able to cope with space is becoming more and more compelling. Complex and detailed models of biochemical systems need to deal with the movement of single molecules and particles, taking into consideration localized fluctuations, transportation phenomena, and diffusion. A common drawback of spatial models lies in their complexity: models can become very large, and their simulation could be time consuming, especially if we want to capture the systems behavior in a reliable way using stochastic methods in conjunction with a high spatial resolution. In order to deliver the promise done by systems biology to be able to understand a system as whole, we need to scale up the size of models we are able to simulate, moving from sequential to parallel simulation algorithms. In this paper, we analyze Smoldyn, a widely diffused algorithm for stochastic simulation of chemical reactions with spatial resolution and single molecule detail, and we propose an alternative, innovative implementation that exploits the parallelism of Graphics Processing Units (GPUs). The implementation executes the most computational demanding steps (computation of diffusion, unimolecular, and bimolecular reaction, as well as the most common cases of molecule-surface interaction) on the GPU, computing them in parallel on each molecule of the system. The implementation offers good speed-ups and real time, high quality graphics output     

Modeling and simulation of molecular biology systems using petri nets: modeling goals of various approaches

Petri nets are a discrete event simulation approach developed for system representation, in particular for their concurrency and synchronization properties. Various extensions to the original theory of Petri nets have been used for modeling molecular biology systems and metabolic networks. These extensions are stochastic, colored, hybrid and functional. This paper carries out an initial review of the various modeling approaches based on Petri net found in the literature, and of the biological systems that have been successfully modeled with these approaches. Moreover, the modeling goals and possibilities of qualitative analysis and system simulation of each approach are discussed.     

Asymmetric Boltzmann machines

We study asymmetric stochastic networks from two points of view: combinatorial optimization and learning algorithms based on relative entropy minimization. We show that there are non trivial classes of asymmetric networks which admit a Lyapunov function under deterministic parallel evolution and prove that the stochastic augmentation of such networks amounts to a stochastic search for global minima of . The problem of minimizing for a totally antisymmetric parallel network is shown to be associated to an NP-complete decision problem. The study of entropic learning for general asymmetric networks, performed in the non equilibrium, time dependent formalism, leads to a Hebbian rule based on time averages over the past history of the system. The general algorithm for asymmetric networks is tested on a feed-forward architecture.This research was supported in part by C.N.R. under grants 88.03556.12 and 89.05261.CT12     

Stochasticity Versus Determinism: Consequences for Realistic Gene Regulatory Network Modelling and Evolution

Gene regulation is one important mechanism in producing observed phenotypes and heterogeneity. Consequently, the study of gene regulatory network (GRN) architecture, function and evolution now forms a major part of modern biology. However, it is impossible to experimentally observe the evolution of GRNs on the timescales on which living species evolve. In silico evolution provides an approach to studying the long-term evolution of GRNs, but many models have either considered network architecture from non-adaptive evolution, or evolution to non-biological objectives. Here, we address a number of important modelling and biological questions about the evolution of GRNs to the realistic goal of biomass production. Can different commonly used simulation paradigms, in particular deterministic and stochastic Boolean networks, with and without basal gene expression, be used to compare adaptive with non-adaptive evolution of GRNs? Are these paradigms together with this goal sufficient to generate a range of solutions? Will the interaction between a biological goal and evolutionary dynamics produce trade-offs between growth and mutational robustness? We show that stochastic basal gene expression forces shrinkage of genomes due to energetic constraints and is a prerequisite for some solutions. In systems that are able to evolve rates of basal expression, two optima, one with and one without basal expression, are observed. Simulation paradigms without basal expression generate bloated networks with non-functional elements. Further, a range of functional solutions was observed under identical conditions only in stochastic networks. Moreover, there are trade-offs between efficiency and yield, indicating an inherent intertwining of fitness and evolutionary dynamics.     

双眼频差平行加工深度的模拟

我们过去的计算分析工作和心理物理实验证明双眼频差率和视差成正比,再根据目前已知的神经生理学研究结果,提出了一个从频差平行加工深度的方案.并在计算机上对三个不同倾斜锥线的立体图对进行了重建深度的模拟.结果满意.对这种平行加工的优点进行了讨论.     

Extraction of biological interaction networks from scientific literature

Biology can be regarded as a science of networks: interactions between various biological entities (eg genes, proteins, metabolites) on different levels (eg gene regulation, cell signalling) can be represented as graphs and, thus, analysis of such networks might shed new light on the function of biological systems. Such biological networks can be obtained from different sources. The extraction of networks from text is an important technique that requires the integration of several different computational disciplines. This paper summarises the most important steps in network extraction and reviews common approaches and solutions for the extraction of biological networks from scientific literature.     

Space as the final frontier in stochastic simulations of biological systems

Recent technological and theoretical advances are only now allowing the simulation of detailed kinetic models of biological systems that reflect the stochastic movement and reactivity of individual molecules within cellular compartments. The behavior of many systems could not be properly understood without this level of resolution, opening up new perspectives of using computer simulations to accelerate biological research. We review the modeling methodology applied to stochastic spatial models, also to the attention of non-expert potential users. Modeling choices, current limitations and perspectives of improvement of current general-purpose modeling/simulation platforms for biological systems are discussed.     

Time accelerated Monte Carlo simulations of biological networks using the binomial tau-leap method

SUMMARY: Developing a quantitative understanding of intracellular networks requires simulations and computational analyses. However, traditional differential equation modeling tools are often inadequate due to the stochasticity of intracellular reaction networks that can potentially influence the phenotypic characteristics. Unfortunately, stochastic simulations are computationally too intense for most biological systems. Herein, we have utilized the recently developed binomial tau-leap method to carry out stochastic simulations of the epidermal growth factor receptor induced mitogen activated protein kinase cascade. Results indicate that the binomial tau-leap method is computationally 100-1000 times more efficient than the exact stochastic simulation algorithm of Gillespie. Furthermore, the binomial tau-leap method avoids negative populations and accurately captures the species populations along with their fluctuations despite the large difference in their size. AVAILABILITY: http://www.dion.che.udel.edu/multiscale/Introduction.html. Fortran 90 code available for academic use by email. SUPPLEMENTARY INFORMATION: Details about the binomial tau-leap algorithm, software and a manual are available at the above website.