'BioNessie(G) - a grid enabled biochemical networks simulation environment

The simulation of biochemical networks provides insight and understanding about the underlying biochemical processes and pathways used by cells and organisms. BioNessie is a biochemical network simulator which has been developed at the University of Glasgow. This paper describes the simulator and focuses in particular on how it has been extended to benefit from a wide variety of high performance compute resources across the UK through Grid technologies to support larger scale simulations

BioNessie - a grid enabled biochemical networks simulation environment

The simulation of biochemical networks provides insight and understanding about the underlying biochemical processes and pathways used by cells and organisms. BioNessie is a biochemical network simulator which has been developed at the University of Glasgow. This paper describes the simulator and focuses in particular on how it has been extended to benefit from a wide variety of high performance compute resources across the UK through Grid technologies to support larger scale simulations

Parallel Load Balancing Strategies for Ensembles of Stochastic Biochemical Simulations

The evolution of biochemical systems where some chemical species are present with only a small number of molecules, is strongly influenced by discrete and stochastic effects that cannot be accurately captured by continuous and deterministic models. The budding yeast cell cycle provides an excellent example of the need to account for stochastic effects in biochemical reactions. To obtain statistics of the cell cycle progression, a stochastic simulation algorithm must be run thousands of times with different initial conditions and parameter values. In order to manage the computational expense involved, the large ensemble of runs needs to be executed in parallel. The CPU time for each individual task is unknown before execution, so a simple strategy of assigning an equal number of tasks per processor can lead to considerable work imbalances and loss of parallel efficiency. Moreover, deterministic analysis approaches are ill suited for assessing the effectiveness of load balancing algorithms in this context. Biological models often require stochastic simulation. Since generating an ensemble of simulation results is computationally intensive, it is important to make efficient use of computer resources. This paper presents a new probabilistic framework to analyze the performance of dynamic load balancing algorithms when applied to large ensembles of stochastic biochemical simulations. Two particular load balancing strategies (point-to-point and all-redistribution) are discussed in detail. Simulation results with a stochastic budding yeast cell cycle model confirm the theoretical analysis. While this work is motivated by cell cycle modeling, the proposed analysis framework is general and can be directly applied to any ensemble simulation of biological systems where many tasks are mapped onto each processor, and where the individual compute times vary considerably among tasks

The validity of quasi steady-state approximations in discrete stochastic simulations

In biochemical networks, reactions often occur on disparate timescales and can be characterized as either "fast" or "slow." The quasi-steady state approximation (QSSA) utilizes timescale separation to project models of biochemical networks onto lower-dimensional slow manifolds. As a result, fast elementary reactions are not modeled explicitly, and their effect is captured by non-elementary reaction rate functions (e.g. Hill functions). The accuracy of the QSSA applied to deterministic systems depends on how well timescales are separated. Recently, it has been proposed to use the non-elementary rate functions obtained via the deterministic QSSA to define propensity functions in stochastic simulations of biochemical networks. In this approach, termed the stochastic QSSA, fast reactions that are part of non-elementary reactions are not simulated, greatly reducing computation time. However, it is unclear when the stochastic QSSA provides an accurate approximation of the original stochastic simulation. We show that, unlike the deterministic QSSA, the validity of the stochastic QSSA does not follow from timescale separation alone, but also depends on the sensitivity of the non-elementary reaction rate functions to changes in the slow species. The stochastic QSSA becomes more accurate when this sensitivity is small. Different types of QSSAs result in non-elementary functions with different sensitivities, and the total QSSA results in less sensitive functions than the standard or the pre-factor QSSA. We prove that, as a result, the stochastic QSSA becomes more accurate when non-elementary reaction functions are obtained using the total QSSA. Our work provides a novel condition for the validity of the QSSA in stochastic simulations of biochemical reaction networks with disparate timescales.Comment: 21 pages, 4 figure

Computational models for inferring biochemical networks

Biochemical networks are of great practical importance. The interaction of biological compounds in cells has been enforced to a proper understanding by the numerous bioinformatics projects, which contributed to a vast amount of biological information. The construction of biochemical systems (systems of chemical reactions), which include both topology and kinetic constants of the chemical reactions, is NP-hard and is a well-studied system biology problem. In this paper, we propose a hybrid architecture, which combines genetic programming and simulated annealing in order to generate and optimize both the topology (the network) and the reaction rates of a biochemical system. Simulations and analysis of an artificial model and three real models (two models and the noisy version of one of them) show promising results for the proposed method.The Romanian National Authority for Scientific Research, CNDI–UEFISCDI, Project No. PN-II-PT-PCCA-2011-3.2-0917

Ergodic and Nonergodic Anomalous Diffusion in Coupled Stochastic Processes

Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin process whose friction coefficient depends on the state of a similar, unobserved process. Integrating out the latter, we derive the long time behaviour of the mean square displacement. Anomalous diffusion is found. Since the diffusion exponent can not be predicted using a simple scaling argument, anomalous scaling appears as well. We also find that the coupling can lead to ergodic or non-ergodic behaviour of the studied process. We compare our theoretical predictions with numerical simulations and find an excellent agreement. The findings caution against treating biochemical systems coupled with unobserved dynamical degrees of freedom by means of standard, diffusive Langevin descriptions

Sampling rare switching events in biochemical networks

Bistable biochemical switches are ubiquitous in gene regulatory networks and signal transduction pathways. Their switching dynamics, however, are difficult to study directly in experiments or conventional computer simulations, because switching events are rapid, yet infrequent. We present a simulation technique that makes it possible to predict the rate and mechanism of flipping of biochemical switches. The method uses a series of interfaces in phase space between the two stable steady states of the switch to generate transition trajectories in a ratchet-like manner. We demonstrate its use by calculating the spontaneous flipping rate of a symmetric model of a genetic switch consisting of two mutually repressing genes. The rate constant can be obtained orders of magnitude more efficiently than using brute-force simulations. For this model switch, we show that the switching mechanism, and consequently the switching rate, depends crucially on whether the binding of one regulatory protein to the DNA excludes the binding of the other one. Our technique could also be used to study rare events and non-equilibrium processes in soft condensed matter systems.Comment: 9 pages, 6 figures, last page contains supplementary informatio