On the precision of quasi steady state assumptions in stochastic dynamics

Stochastic approximations of higher-molecular by bi-molecular reactions

Reactions involving three or more reactants, called higher-molecular reactions, play an important role in mathematical modelling in systems and synthetic biology. In particular, such reactions underpin a variety of important bio-dynamical phenomena, such as multi-stability/multi-modality, oscillations, bifurcations, and noise-induced effects. However, as opposed to reactions involving at most two reactants, called bi-molecular reactions, higher-molecular reactions are biochemically improbable. To bridge the gap, in this paper we put forward an algorithm for systematically approximating arbitrary higher-molecular reactions with bi-molecular ones, while preserving the underlying stochastic dynamics. Properties of the algorithm and convergence are established via singular perturbation theory. The algorithm is applied to a variety of higher-molecular biochemical networks, and is shown to play an important role in synthetic biology.

On the Validity of the Stochastic Quasi-Steady-State Approximation in Open Enzyme Catalyzed Reactions: Timescale Separation or Singular Perturbation?

The quasi-steady-state approximation is widely used to develop simplified deterministic or stochastic models of enzyme catalyzed reactions. In deterministic models, the quasi-steady-state approximation can be mathematically justified from singular perturbation theory. For several closed enzymatic reactions, the homologous extension of the quasi-steady-state approximation to the stochastic regime, known as the stochastic quasi-steady-state approximation, has been shown to be accurate under the analogous conditions that permit the quasi-steady-state reduction in the deterministic counterpart. However, it was recently demonstrated that the extension of the stochastic quasi-steady-state approximation to an open Michaelis-Menten reaction mechanism is only valid under a condition that is far more restrictive than the qualifier that ensures the validity of its corresponding deterministic quasi-steady-state approximation. In this paper, we suggest a possible explanation for this discrepancy from the lens of geometric singular perturbation theory. In so doing, we illustrate a misconception in the application of the quasi-steady-state approximation: timescale separation does not imply singular perturbation.

Universally valid reduction of multiscale stochastic biochemical systems using simple non-elementary propensities

Biochemical systems consist of numerous elementary reactions governed by the law of mass action. However, experimentally characterizing all the elementary reactions is nearly impossible. Thus, over a century, their deterministic models that typically contain rapid reversible bindings have been simplified with non-elementary reaction functions (e.g., Michaelis-Menten and Morrison equations). Although the non-elementary reaction functions are derived by applying the quasi-steady-state approximation (QSSA) to deterministic systems, they have also been widely used to derive propensities for stochastic simulations due to computational efficiency and simplicity. However, the validity condition for this heuristic approach has not been identified even for the reversible binding between molecules, such as protein-DNA, enzyme-substrate, and receptor-ligand, which is the basis for living cells. Here, we find that the non-elementary propensities based on the deterministic total QSSA can accurately capture the stochastic dynamics of the reversible binding in general. However, serious errors occur when reactant molecules with similar levels tightly bind, unlike deterministic systems. In that case, the non-elementary propensities distort the stochastic dynamics of a bistable switch in the cell cycle and an oscillator in the circadian clock. Accordingly, we derive alternative non-elementary propensities with the stochastic low-state QSSA, developed in this study. This provides a universally valid framework for simplifying multiscale stochastic biochemical systems with rapid reversible bindings, critical for efficient stochastic simulations of cell signaling and gene regulation. To facilitate the framework, we provide a user-friendly open-source computational package, ASSISTER, that automatically performs the present framework.

Quantifying the roles of space and stochasticity in computer simulations for cell biology and cellular biochemistry

Most of the fascinating phenomena studied in cell biology emerge from interactions among highly organized multimolecular structures embedded into complex and frequently dynamic cellular morphologies. For the exploration of such systems, computer simulation has proved to be an invaluable tool, and many researchers in this field have developed sophisticated computational models for application to specific cell biological questions. However, it is often difficult to reconcile conflicting computational results that use different approaches to describe the same phenomenon. To address this issue systematically, we have defined a series of computational test cases ranging from very simple to moderately complex, varying key features of dimensionality, reaction type, reaction speed, crowding, and cell size. We then quantified how explicit spatial and/or stochastic implementations alter outcomes, even when all methods use the same reaction network, rates, and concentrations. For simple cases, we generally find minor differences in solutions of the same problem. However, we observe increasing discordance as the effects of localization, dimensionality reduction, and irreversible enzymatic reactions are combined. We discuss the strengths and limitations of commonly used computational approaches for exploring cell biological questions and provide a framework for decision making by researchers developing new models. As computational power and speed continue to increase at a remarkable rate, the dream of a fully comprehensive computational model of a living cell may be drawing closer to reality, but our analysis demonstrates that it will be crucial to evaluate the accuracy of such models critically and systematically.

Misuse of the Michaelis-Menten rate law for protein interaction networks and its remedy

For over a century, the Michaelis-Menten (MM) rate law has been used to describe the rates of enzyme-catalyzed reactions and gene expression. Despite the ubiquity of the MM rate law, it accurately captures the dynamics of underlying biochemical reactions only so long as it is applied under the right condition, namely, that the substrate is in large excess over the enzyme-substrate complex. Unfortunately, in circumstances where its validity condition is not satisfied, especially so in protein interaction networks, the MM rate law has frequently been misused. In this review, we illustrate how inappropriate use of the MM rate law distorts the dynamics of the system, provides mistaken estimates of parameter values, and makes false predictions of dynamical features such as ultrasensitivity, bistability, and oscillations. We describe how these problems can be resolved with a slightly modified form of the MM rate law, based on the total quasi-steady state approximation (tQSSA). Furthermore, we show that the tQSSA can be used for accurate stochastic simulations at a lower computational cost than using the full set of mass-action rate laws. This review describes how to use quasi-steady state approximations in the right context, to prevent drawing erroneous conclusions from in silico simulations.

Late-Arriving Signals Contribute Less to Cell-Fate Decisions

Gene regulatory networks are largely responsible for cellular decision-making. These networks sense diverse external signals and respond by adjusting gene expression, enabling cells to reach environment-dependent decisions crucial for their survival or reproduction. However, information-carrying signals may arrive at variable times. Besides the intrinsic strength of these signals, their arrival time (timing) may also carry information about the environment and can influence cellular decision-making in ways that are poorly understood. For example, it is unclear how the timing of individual phage infections affects the lysis-lysogeny decision of bacteriophage λ despite variable infection times being likely in the wild and even in laboratory conditions. In this work, we combine mathematical modeling with experimentation to address this question. We develop an experimentally testable theory, which reveals that late-infecting phages contribute less to cellular decision-making. This implies that infection delays lower the probability of lysogeny compared to simultaneous infections. Furthermore, we show that infection delays reduce lysogenization by providing insufficient CII for threshold crossing during the critical decision-making period. We find evidence for a cutoff time after which subsequent infections cannot influence the cellular decision. We derive an intuitive formula that approximates the probability of lysogeny for variable infection times by a time-weighted average of probabilities for simultaneous infections. We validate these theoretical predictions experimentally. Similar concepts and simplifying modeling approaches may help elucidate the mechanisms underlying other cellular decisions.

Reduction of multiscale stochastic biochemical reaction networks using exact moment derivation

Biochemical reaction networks (BRNs) in a cell frequently consist of reactions with disparate timescales. The stochastic simulations of such multiscale BRNs are prohibitively slow due to high computational cost for the simulations of fast reactions. One way to resolve this problem uses the fact that fast species regulated by fast reactions quickly equilibrate to their stationary distribution while slow species are unlikely to be changed. Thus, on a slow timescale, fast species can be replaced by their quasi-steady state (QSS): their stationary conditional expectation values for given slow species. As the QSS are determined solely by the state of slow species, such replacement leads to a reduced model, where fast species are eliminated. However, it is challenging to derive the QSS in the presence of nonlinear reactions. While various approximation schemes for the QSS have been developed, they often lead to considerable errors. Here, we propose two classes of multiscale BRNs which can be reduced by deriving an exact QSS rather than approximations. Specifically, if fast species constitute either a feedforward network or a complex balanced network, the reduced model based on the exact QSS can be derived. Such BRNs are frequently observed in a cell as the feedforward network is one of fundamental motifs of gene or protein regulatory networks. Furthermore, complex balanced networks also include various types of fast reversible bindings such as bindings between transcriptional factors and gene regulatory sites. The reduced models based on exact QSS, which can be calculated by the computational packages provided in this work, accurately approximate the slow scale dynamics of the original full model with much lower computational cost.

Stochastic neutral modelling of the Gut Microbiota's relative species abundance from next generation sequencing data

Background

Interest in understanding the mechanisms that lead to a particular composition of the Gut Microbiota is highly increasing, due to the relationship between this ecosystem and the host health state. Particularly relevant is the study of the Relative Species Abundance (RSA) distribution, that is a component of biodiversity and measures the number of species having a given number of individuals. It is the universal behaviour of RSA that induced many ecologists to look for theoretical explanations. In particular, a simple stochastic neutral model was proposed by Volkov et al. relying on population dynamics and was proved to fit the coral-reefs and rain forests RSA. Our aim is to ascertain if this model also describes the Microbiota RSA and if it can help in explaining the Microbiota plasticity.

Results

We analyzed 16S rRNA sequencing data sampled from the Microbiota of three different animal species by Jeraldo et al. Through a clustering procedure (UCLUST), we built the Operational Taxonomic Units. These correspond to bacterial species considered at a given phylogenetic level defined by the similarity threshold used in the clustering procedure. The RSAs, plotted in the form of Preston plot, were fitted with Volkov’s model. The model fits well the Microbiota RSA, except in the tail region, that shows a deviation from the neutrality assumption. Looking at the model parameters we were able to discriminate between different animal species, giving also a biological explanation. Moreover, the biodiversity estimator obtained by Volkov’s model also differentiates the animal species and is in good agreement with the first and second order Hill’s numbers, that are common evenness indexes simply based on the fraction of individuals per species.

Conclusions

We conclude that the neutrality assumption is a good approximation for the Microbiota dynamics and the observation that Volkov’s model works for this ecosystem is a further proof of the RSA universality. Moreover, the ability to separate different animals with the model parameters and biodiversity number are promising results if we think about future applications on human data, in which the Microbiota composition and biodiversity are in close relationships with a variety of diseases and life-styles.

Mathematical modeling and validation of glucose compensation of the neurospora circadian clock

Autonomous circadian oscillations arise from transcriptional-translational feedback loops of core clock components. The period of a circadian oscillator is relatively insensitive to changes in nutrients (e.g., glucose), which is referred to as "nutrient compensation". Recently, a transcription repressor, CSP-1, was identified as a component of the circadian system in Neurospora crassa. The transcription of csp-1 is under the circadian regulation. Intriguingly, CSP-1 represses the circadian transcription factor, WC-1, forming a negative feedback loop that can influence the core oscillator. This feedback mechanism is suggested to maintain the circadian period in a wide range of glucose concentrations. In this report, we constructed a mathematical model of the Neurospora circadian clock incorporating the above WC-1/CSP-1 feedback loop, and investigated molecular mechanisms of glucose compensation. Our model shows that glucose compensation exists within a narrow range of parameter space where the activation rates of csp-1 and wc-1 are balanced with each other, and simulates loss of glucose compensation in csp-1 mutants. More importantly, we experimentally validated rhythmic oscillations of the wc-1 gene expression and loss of glucose compensation in the wc-1(ov) mutant as predicted in the model. Furthermore, our stochastic simulations demonstrate that the CSP-1-dependent negative feedback loop functions in glucose compensation, but does not enhance the overall robustness of oscillations against molecular noise. Our work highlights predictive modeling of circadian clock machinery and experimental validations employing Neurospora and brings a deeper understanding of molecular mechanisms of glucose compensation.

The relationship between stochastic and deterministic quasi-steady state approximations

Background

The quasi steady-state approximation (QSSA) is frequently used to reduce deterministic models of biochemical networks. The resulting equations provide a simplified description of the network in terms of non-elementary reaction functions (e.g. Hill functions). Such deterministic reductions are frequently a basis for heuristic stochastic models in which non-elementary reaction functions are used to define reaction propensities. Despite their popularity, it remains unclear when such stochastic reductions are valid. It is frequently assumed that the stochastic reduction can be trusted whenever its deterministic counterpart is accurate. However, a number of recent examples show that this is not necessarily the case.

Results

Here we explain the origin of these discrepancies, and demonstrate a clear relationship between the accuracy of the deterministic and the stochastic QSSA for examples widely used in biological systems. With an analysis of a two-state promoter model, and numerical simulations for a variety of other models, we find that the stochastic QSSA is accurate whenever its deterministic counterpart provides an accurate approximation over a range of initial conditions which cover the likely fluctuations from the quasi steady-state (QSS). We conjecture that this relationship provides a simple and computationally inexpensive way to test the accuracy of reduced stochastic models using deterministic simulations.

Conclusions

The stochastic QSSA is one of the most popular multi-scale stochastic simulation methods. While the use of QSSA, and the resulting non-elementary functions has been justified in the deterministic case, it is not clear when their stochastic counterparts are accurate. In this study, we show how the accuracy of the stochastic QSSA can be tested using their deterministic counterparts providing a concrete method to test when non-elementary rate functions can be used in stochastic simulations.

Electronic supplementary material

The online version of this article (doi:10.1186/s12918-015-0218-3) contains supplementary material, which is available to authorized users.

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 nonelementary 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 nonelementary 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 nonelementary 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 nonelementary 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 nonelementary functions with different sensitivities, and the total QSSA results in less sensitive functions than the standard or the prefactor QSSA. We prove that, as a result, the stochastic QSSA becomes more accurate when nonelementary reaction functions are obtained using the total QSSA. Our work provides an apparently novel condition for the validity of the QSSA in stochastic simulations of biochemical reaction networks with disparate timescales.

Adaptive deployment of model reductions for tau-leaping simulation

Multiple time scales in cellular chemical reaction systems often render the tau-leaping algorithm inefficient. Various model reductions have been proposed to accelerate tau-leaping simulations. However, these are often identified and deployed manually, requiring expert knowledge. This is time-consuming and prone to error. In previous work, we proposed a methodology for automatic identification and validation of model reduction opportunities for tau-leaping simulation. Here, we show how the model reductions can be automatically and adaptively deployed during the time course of a simulation. For multiscale systems, this can result in substantial speedups.

A queueing approach to multi-site enzyme kinetics

Multi-site enzymes, defined as where multiple substrate molecules can bind simultaneously to the same enzyme molecule, play a key role in a number of biological networks, with the Escherichia coli protease ClpXP a well-studied example. These enzymes can form a low latency 'waiting line' of substrate to the enzyme's catalytic core, such that the enzyme molecule can continue to collect substrate even when the catalytic core is occupied. To understand multi-site enzyme kinetics, we study a discrete stochastic model that includes a single catalytic core fed by a fixed number of substrate binding sites. A natural queueing systems analogy is found to provide substantial insight into the dynamics of the model. From this, we derive exact results for the probability distribution of the enzyme configuration and for the distribution of substrate departure times in the case of identical but distinguishable classes of substrate molecules. Comments are also provided for the case when different classes of substrate molecules are not processed identically.

Rigorous elimination of fast stochastic variables from the linear noise approximation using projection operators

The linear noise approximation (LNA) offers a simple means by which one can study intrinsic noise in monostable biochemical networks. Using simple physical arguments, we have recently introduced the slow-scale LNA (ssLNA), which is a reduced version of the LNA under conditions of timescale separation. In this paper we present the first rigorous derivation of the ssLNA using the projection operator technique and show that the ssLNA follows uniquely from the standard LNA under the same conditions of timescale separation as those required for the deterministic quasi-steady-state approximation. We also show that the large molecule number limit of several common stochastic model reduction techniques under timescale separation conditions constitutes a special case of the ssLNA.