Linear mapping approximation of gene regulatory networks with stochastic dynamics

107Citations
Citations of this article
63Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The presence of protein–DNA binding reactions often leads to analytically intractable models of stochastic gene expression. Here we present the linear-mapping approximation that maps systems with protein–promoter interactions onto approximately equivalent systems with no binding reactions. This is achieved by the marriage of conditional mean-field approximation and the Magnus expansion, leading to analytic or semi-analytic expressions for the approximate time-dependent and steady-state protein number distributions. Stochastic simulations verify the method’s accuracy in capturing the changes in the protein number distributions with time for a wide variety of networks displaying auto- and mutual-regulation of gene expression and independently of the ratios of the timescales governing the dynamics. The method is also used to study the first-passage time distribution of promoter switching, the sensitivity of the size of protein number fluctuations to parameter perturbation and the stochastic bifurcation diagram characterizing the onset of multimodality in protein number distributions.

Cite

CITATION STYLE

APA

Cao, Z., & Grima, R. (2018). Linear mapping approximation of gene regulatory networks with stochastic dynamics. Nature Communications, 9(1). https://doi.org/10.1038/s41467-018-05822-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free