Bursting noise in gene expression dynamics: linking microscopic and mesoscopic models

2017

Preprint

Burst-like synthesis of protein is a significant source of cell-to-cell variability in protein levels. Negative feedback is a common example of a regulatory mechanism by which such stochasticity can be controlled. Here we consider a specific kind of negative feedback, which makes bursts smaller in the excess of protein. Increasing the strength of the feedback may lead to dramatically different outcomes depending on a key parameter, the noise load, which is defined as the squared coefficient of variation the protein exhibits in the absence of feedback. Combining stochastic simulation with asymptotic analysis, we identify a critical value of noise load: for noise loads smaller than critical, the coefficient of variation remains bounded with increasing feedback strength; contrastingly, if the noise load is larger than critical, the coefficient of variation diverges to infinity in the limit of ever greater feedback strengths. Interestingly, high-cooperativity feedbacks have lower critical noise loads, implying that low-cooperativity feedbacks in burst size can be preferable for noisy proteins. Finally, we discuss our findings in the context of previous results on the impact of negative feedback in burst size and burst frequency on gene-expression noise.

Section: Introductionmentioning

confidence: 99%

High cooperativity in negative feedback can amplify noisy gene expression

Bokes

Singh

2017

Preprint

“…Piecewise-deterministic Markov processes (PDMP) have become a useful, coarse-grained description of stochastic gene dynamics, where the underlying discrete variable s(t) captures the stochastic dynamics of gene states and the continuous variable λ(t) captures the first moment of downstream gene products [36][37][38][39][40][41][42]. The key FIG.…”

Section: Discussionmentioning

confidence: 99%

Accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

2018

Preprint

Self Cite

Understanding how stochastic gene expression is regulated in biological systems using snapshots of single-cell transcripts requires state-of-the-art methods of computational analysis and statistical inference. A Bayesian approach to statistical inference is the most complete method for model selection and uncertainty quantification of kinetic parameters from single-cell data. This approach is impractical because current numerical algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piece-wise deterministic Markov process. We combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We validated our method of accelerated Bayesian inference on several synthetic data sets. Our results show that kinetic parameters can be reasonably constrained for modestly sampled data sets, if the model is known a priori. If the model is unknown,the Bayesian evidence can be used to rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics, e.g., Bayesian Information Criterion (BIC) or Akaike Information Criterion (AIC), often used for model selection.

“…When λ is too small, one or more populations become discrete. Discrete populations have distinct dynamics, which are not captured by a Fokker-Planck equation 17,18,21 . Thus, the analysis of the previous section eventually becomes invalid and errors are introduced as λ decreases and becomes too small.…”

Section: Limitation By Small But Critical Populationsmentioning

confidence: 99%

Scaling methods for accelerating kinetic Monte Carlo simulations of chemical reaction networks

The Journal of Chemical Physics

Hlavacek

2019

Self Cite

Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on adaptive and heterogeneous scaling of reaction rates and stoichiometric coefficients. The algorithm is conceptually related to the commonly used idea of accelerating a stochastic simulation by considering a sub-volume λΩ (0 < λ < 1) within a system of interest, which reduces the number of reaction events per unit time occurring in a simulation by a factor 1/λ at the cost of greater error in unbiased estimates of first moments and biased overestimates of second moments. Our new approach offers two unique benefits. First, scaling is adaptive and heterogeneous, which eliminates the pitfall of overaggressive scaling. Second, there is no need for an a priori classification of populations as discrete or continuous (as in a hybrid method), which is problematic when discreteness of a chemical species changes during a simulation. The method requires specification of only a single algorithmic parameter, N c , a global critical population size above which populations are effectively scaled down to increase simulation efficiency. The method, which we term partial scaling, is implemented in the open-source BioNetGen software package. We demonstrate that partial scaling can significantly accelerate simulations without significant loss of accuracy for several published models of biological systems. These models characterize activation of the mitogen-activated protein kinase ERK, prion protein aggregation, and T-cell receptor signaling. arXiv:1903.08615v2 [q-bio.QM]