A moment-convergence method for stochastic analysis of biochemical reaction networks

A modified variational approach to noisy cell signaling

Signaling in cells is full of noise and, hence, described with stochastic biochemical models. Thus, an efficient computation algorithm for these fluctuating reactions is much needed. Apart from the very popular Monte Carlo simulation, methods based on probability distributions are frequently desired due to their analytical tractability and possible numerical advantages in diverse circumstances, among which the variational approach is the most notable. In this paper, new basis functions are proposed to better depict possibly complex distribution profiles, and an extra regularization scheme is supplied to the variational equation to remove occasional degeneracy-induced singularities during the evolution. The new extension is applied to four typical biochemical reaction models and restores the Gillespie results accurately but with greatly reduced simulation time. This modified variational approach is expected to work in a wide range of cell signaling networks.

Exact results for gene-expression models with general waiting-time distributions

Complex molecular details of transcriptional regulation can be coarse-grained by assuming that reaction waiting times for promoter-state transitions, the mRNA synthesis, and the mRNA degradation follow general distributions. However, how such a generalized two-state model is analytically solved is a long-standing issue. Here we first present analytical formulas of burst-size distributions for this model. Then, we derive an iterative equation for the mRNA moment-generating function, by which mRNA raw and binomial moments of any order can be conveniently calculated. The analytical results obtained in the special cases of phase-type waiting-time distributions not only provide insights into the mechanisms of complex transcriptional regulations but also bring conveniences for experimental data-based statistical inferences.

Inferring transcriptional bursting kinetics from single-cell snapshot data using a generalized telegraph model

Gene expression has inherent stochasticity resulting from transcription's burst manners. Single-cell snapshot data can be exploited to rigorously infer transcriptional burst kinetics, using mathematical models as blueprints. The classical telegraph model (CTM) has been widely used to explain transcriptional bursting with Markovian assumptions. However, growing evidence suggests that the gene-state dwell times are generally non-exponential, as gene-state switching is a multi-step process in organisms. Therefore, interpretable non-Markovian mathematical models and efficient statistical inference methods are urgently required in investigating transcriptional burst kinetics. We develop an interpretable and tractable model, the generalized telegraph model (GTM), to characterize transcriptional bursting that allows arbitrary dwell-time distributions, rather than exponential distributions, to be incorporated into the ON and OFF switching process. Based on the GTM, we propose an inference method for transcriptional bursting kinetics using an approximate Bayesian computation framework. This method demonstrates an efficient and scalable estimation of burst frequency and burst size on synthetic data. Further, the application of inference to genome-wide data from mouse embryonic fibroblasts reveals that GTM would estimate lower burst frequency and higher burst size than those estimated by CTM. In conclusion, the GTM and the corresponding inference method are effective tools to infer dynamic transcriptional bursting from static single-cell snapshot data.

Kinetic characteristics of transcriptional bursting in a complex gene model with cyclic promoter structure

While transcription often occurs in a bursty manner, various possible regulations can lead to complex promoter patterns such as promoter cycles, giving rise to an important question: How do promoter kinetics shape transcriptional bursting kinetics? Here we introduce and analyze a general model of the promoter cycle consisting of multi-OFF states and multi-ON states, focusing on the effects of multi-ON mechanisms on transcriptional bursting kinetics. The derived analytical results indicate that burst size follows a mixed geometric distribution rather than a single geometric distribution assumed in previous studies, and ON and OFF times obey their own mixed exponential distributions. In addition, we find that the multi-ON mechanism can lead to bimodal burst-size distribution, antagonistic timing of ON and OFF, and diverse burst frequencies, each further contributing to cell-to-cell variability in the mRNA expression level. These results not only reveal essential features of transcriptional bursting kinetics patterns shaped by multi-state mechanisms but also can be used to the inferences of transcriptional bursting kinetics and promoter structure based on experimental data.

Silent transcription intervals and translational bursting lead to diverse phenotypic switching

For complex process of gene expression, we use theoretical analysis and stochastic simulations to study the phenotypic diversity induced by silent transcription intervals and translational bursting.

Exact distributions for stochastic gene expression models with arbitrary promoter architecture and translational bursting

Gene expression in individual cells is inherently variable and sporadic, leading to cell-to-cell variability in mRNA and protein levels. Recent single-cell and single-molecule experiments indicate that promoter architecture and translational bursting play significant roles in controlling gene expression noise and generating the phenotypic diversity that life exhibits. To quantitatively understand the impact of these factors, it is essential to construct an accurate mathematical description of stochastic gene expression and find the exact analytical results, which is a formidable task. Here, we develop a stochastic model of bursty gene expression, which considers the complex promoter architecture governing the variability in mRNA expression and a general distribution characterizing translational burst. We derive the analytical expression for the corresponding protein steady-state distribution and all moment statistics of protein counts. We show that the total protein noise can be decomposed into three parts: the low-copy noise of protein due to probabilistic individual birth and death events, the noise due to stochastic switching between promoter states, and the noise resulting from translational busting. The theoretical results derived provide quantitative insights into the biochemical mechanisms of stochastic gene expression.

Steady-state joint distribution for first-order stochastic reaction kinetics

While the analytical solution for the marginal distribution of a stochastic chemical reaction network has been extensively studied, its joint distribution, i.e., the solution of a high-dimensional chemical master equation, has received much less attention. Here we develop an alternative method of computing the exact joint distributions of a wide class of first-order stochastic reaction systems in steady-state conditions. The effectiveness of our method is validated by applying it to four gene expression models of biological significance, including models with 2A peptides, nascent mRNA, gene regulation, translational bursting, and alternative splicing.

Exact results for queuing models of stochastic transcription with memory and crosstalk

Gene transcription is a complex multistep biochemical process, which can create memory between individual reaction events. On the other hand, many inducible genes, when activated by external cues, are often coregulated by several competitive pathways with crosstalk. This raises an unexplored question: how do molecular memory and crosstalk together affect gene expressions? To address this question, we introduce a queuing model of stochastic transcription, where two crossing signaling pathways are used to direct gene activation in response to external signals and memory functions to model multistep reaction processes involved in transcription. We first establish, based on the total probability principle, the chemical master equation for this queuing model, and then we derive, based on the binomial moment approach, exact expressions for statistical quantities (including distributions) of mRNA, which provide insights into the roles of crosstalk and memory in controlling the mRNA level and noise. We find that molecular memory of gene activation decreases the mRNA level but increases the mRNA noise, and double activation pathways always reduce the mRNA noise in contrast to a single pathway. In addition, we find that molecular memory can make the mRNA bimodality disappear.

Correlation between external regulators governs the mean-noise relationship in stochastic gene expression

Gene transcription in single cells is inherently a probabilistic process. The relationship between variance ($ \sigma^{2} $) and mean expression ($ \mu $) is of paramount importance for investigations into the evolutionary origins and consequences of noise in gene expression. It is often formulated as $ \log \left({{{\sigma}^{2}}}/{{{\mu}^{2}}}\; \right) = \beta\log\mu+\log\alpha $, where $ \beta $ is a key parameter since its sign determines the qualitative dependence of noise on mean. We reveal that the sign of $ \beta $ is controlled completely by external regulation, but independent of promoter structure. Specifically, it is negative if regulators as stochastic variables are independent but positive if they are correlated. The essential mechanism revealed here can well interpret diverse experimental phenomena underlying expression noise. Our results imply that external regulation rather than promoter sequence governs the mean-noise relationship.

Queuing Models of Gene Expression: Analytical Distributions and Beyond

Activation of a gene is a multistep biochemical process, involving recruitments of transcription factors and histone kinases as well as modification of histones. Many of these intermediate reaction steps would have been unspecified by experiments. Therefore, classical two-state models of gene expression established based on the memoryless (or Markovian) assumption would not well describe the reality in gene expression. Recent experimental data have indicated that the inactive phases of gene promoters are differently distributed, showing strong memory. Here, we use a nonexponential waiting-time distribution to model the complex activation process of a gene, and then analyze a queuing model of stochastic transcription. We successfully derive the analytical expression of the stationary mRNA distribution, which provides insight into the effect of molecular memory created by complex activating events on the mRNA expression. We find that the reduction in the waiting-time noise may result in the increase in the mRNA noise, contrary to the previous conclusion. Based on the derived distribution, we also develop a method to infer the waiting-time distribution from a known mRNA distribution. Data analysis on a realistic example verifies the validity of this method.

Moment dynamics for gene regulation with rational rate laws

This aim of this paper is mainly to investigate the performance of two typical moment closure schemes in gene regulatory master equations of rational rate laws. When the reaction rate is polynomial, the error bounds between the authentic and approximate moments obtained by schemes of Gaussian moment closure and log-normal moment closure are explicitly given. When the reaction rate is not polynomial, it is shown that the two schemes both behave well in the absence of active-inactive state switch, but in the presence of active-inactive state switch the log-normal closure scheme is far superior to the Gaussian closure scheme in capturing the asymptotic ensemble statistics. Moreover, the accuracy of the log-normal closure method is further confirmed by steady-state analytic results and the conditional Gaussian closure method. It is also disclosed that optimal negative feedback exists in suppressing protein noise in the presence of the on-off switch control.

Stochastic master equation for early protein aggregation in the transthyretin amyloid disease

It is significant to understand the earliest molecular events occurring in the nucleation of the amyloid aggregation cascade for the prevention of amyloid related diseases such as transthyretin amyloid disease. We develop chemical master equation for the aggregation of monomers into oligomers using reaction rate law in chemical kinetics. For this stochastic model, lognormal moment closure method is applied to track the evolution of relevant statistical moments and its high accuracy is confirmed by the results obtained from Gillespie's stochastic simulation algorithm. Our results show that the formation of oligomers is highly dependent on the number of monomers. Furthermore, the misfolding rate also has an important impact on the process of oligomers formation. The quantitative investigation should be helpful for shedding more light on the mechanism of amyloid fibril nucleation.

Accuracy of parameter estimation for auto-regulatory transcriptional feedback loops from noisy data

Bayesian and non-Bayesian moment-based inference methods are commonly used to estimate the parameters defining stochastic models of gene regulatory networks from noisy single cell or population snapshot data. However, a systematic investigation of the accuracy of the predictions of these methods remains missing. Here, we present the results of such a study using synthetic noisy data of a negative auto-regulatory transcriptional feedback loop, one of the most common building blocks of complex gene regulatory networks. We study the error in parameter estimation as a function of (i) number of cells in each sample; (ii) the number of time points; (iii) the highest-order moment of protein fluctuations used for inference; (iv) the moment-closure method used for likelihood approximation. We find that for sample sizes typical of flow cytometry experiments, parameter estimation by maximizing the likelihood is as accurate as using Bayesian methods but with a much reduced computational time. We also show that the choice of moment-closure method is the crucial factor determining the maximum achievable accuracy of moment-based inference methods. Common likelihood approximation methods based on the linear noise approximation or the zero cumulants closure perform poorly for feedback loops with large protein-DNA binding rates or large protein bursts; this is exacerbated for highly heterogeneous cell populations. By contrast, approximating the likelihood using the linear-mapping approximation or conditional derivative matching leads to highly accurate parameter estimates for a wide range of conditions.

Detecting critical transitions in the case of moderate or strong noise by binomial moments

Detecting critical transitions in the case of moderate or strong noise (collectively referred to as big noise) is challenging, since such noise can make a critical transition point far from the bifurcation point, leading to the failure of traditional small-noise methods. To handle this tough issue, we first transform a generic noisy system into a linear set of binomial moment equations (BMEs). Then, we can solve a closed set of BMEs obtained by truncation and use the resulting binomial moments to reconstruct a joint probability distribution of the state variables of the original system. Third, we derive a leading indicator from the closed set of BMEs. Importantly, the reconstructed distribution determines the way of critical transition (i.e., critical transition is distribution transition rather than state transition in the strong-noise case) as the system comes close to the critical transition point, whereas the derived indicator anticipates when the distribution transition occurs. Our theory has broad applications, and artificial and data examples exhibit its power.

Linear approximations of global behaviors in nonlinear systems with moderate or strong noise

While many physical or chemical systems can be modeled by nonlinear Langevin equations (LEs), dynamical analysis of these systems is challenging in the cases of moderate and strong noise. Here we develop a linear approximation scheme, which can transform an often intractable LE into a linear set of binomial moment equations (BMEs). This scheme provides a feasible way to capture nonlinear behaviors in the sense of probability distribution and is effective even when the noise is moderate or big. Based on BMEs, we further develop a noise reduction technique, which can effectively handle tough cases where traditional small-noise theories are inapplicable. The overall method not only provides an approximation-based paradigm to analysis of the local and global behaviors of nonlinear noisy systems but also has a wide range of applications.

Exploring intermediate cell states through the lens of single cells

As our catalog of cell states expands, appropriate characterization of these states and the transitions between them is crucial. Here we discuss the roles of intermediate cell states (ICSs) in this growing collection. We begin with definitions and discuss evidence for the existence of ICSs and their relevance in various tissues. We then provide a list of possible functions for ICSs with examples. Finally, we describe means by which ICSs and their functional roles can be identified from single-cell data or predicted from models.

A scalable moment-closure approximation for large-scale biochemical reaction networks

Motivation

Stochastic molecular processes are a leading cause of cell-to-cell variability. Their dynamics are often described by continuous-time discrete-state Markov chains and simulated using stochastic simulation algorithms. As these stochastic simulations are computationally demanding, ordinary differential equation models for the dynamics of the statistical moments have been developed. The number of state variables of these approximating models, however, grows at least quadratically with the number of biochemical species. This limits their application to small- and medium-sized processes.

Results

In this article, we present a scalable moment-closure approximation (sMA) for the simulation of statistical moments of large-scale stochastic processes. The sMA exploits the structure of the biochemical reaction network to reduce the covariance matrix. We prove that sMA yields approximating models whose number of state variables depends predominantly on local properties, i.e. the average node degree of the reaction network, instead of the overall network size. The resulting complexity reduction is assessed by studying a range of medium- and large-scale biochemical reaction networks. To evaluate the approximation accuracy and the improvement in computational efficiency, we study models for JAK2/STAT5 signalling and NF κ B signalling. Our method is applicable to generic biochemical reaction networks and we provide an implementation, including an SBML interface, which renders the sMA easily accessible.

Availability and implementation

The sMA is implemented in the open-source MATLAB toolbox CERENA and is available from https://github.com/CERENADevelopers/CERENA .

Contact

jan.hasenauer@helmholtz-muenchen.de or atefeh.kazeroonian@tum.de.

Supplementary information

Supplementary data are available at Bioinformatics online.