286 research outputs found
A Minimal Model of Signaling Network Elucidates Cell-to-Cell Stochastic Variability in Apoptosis
Signaling networks are designed to sense an environmental stimulus and adapt
to it. We propose and study a minimal model of signaling network that can sense
and respond to external stimuli of varying strength in an adaptive manner. The
structure of this minimal network is derived based on some simple assumptions
on its differential response to external stimuli. We employ stochastic
differential equations and probability distributions obtained from stochastic
simulations to characterize differential signaling response in our minimal
network model. We show that the proposed minimal signaling network displays two
distinct types of response as the strength of the stimulus is decreased. The
signaling network has a deterministic part that undergoes rapid activation by a
strong stimulus in which case cell-to-cell fluctuations can be ignored. As the
strength of the stimulus decreases, the stochastic part of the network begins
dominating the signaling response where slow activation is observed with
characteristic large cell-to-cell stochastic variability. Interestingly, this
proposed stochastic signaling network can capture some of the essential
signaling behaviors of a complex apoptotic cell death signaling network that
has been studied through experiments and large-scale computer simulations. Thus
we claim that the proposed signaling network is an appropriate minimal model of
apoptosis signaling. Elucidating the fundamental design principles of complex
cellular signaling pathways such as apoptosis signaling remains a challenging
task. We demonstrate how our proposed minimal model can help elucidate the
effect of a specific apoptotic inhibitor Bcl-2 on apoptotic signaling in a
cell-type independent manner. We also discuss the implications of our study in
elucidating the adaptive strategy of cell death signaling pathways.Comment: 9 pages, 6 figure
Programmability of Chemical Reaction Networks
Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a well-stirred solution according to standard chemical kinetics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines. A theme to these investigations is the thin line between decidable and undecidable questions about SCRN behavior
A GFP-lacZ Bicistronic Reporter System for Promoter Analysis in Environmental Gram-Negative Bacteria
Here, we describe a bicistronic reporter system for the analysis of promoter activity in a variety of Gram-negative bacteria at both the population and single-cell levels. This synthetic genetic tool utilizes an artificial operon comprising the gfp and lacZ genes that are assembled in a suicide vector, which is integrated at specific sites within the chromosome of the target bacterium, thereby creating a monocopy reporter system. This tool was instrumental for the complete in vivo characterization of two promoters, Pb and Pc, that drive the expression of the benzoate and catechol degradation pathways, respectively, of the soil bacterium Pseudomonas putida KT2440. The parameterization of these promoters in a population (using β-galactosidase assays) and in single cells (using flow cytometry) was necessary to examine the basic numerical features of these systems, such as the basal and maximal levels and the induction kinetics in response to an inducer (benzoate). Remarkably, GFP afforded a view of the process at a much higher resolution compared with standard lacZ tests; changes in fluorescence faithfully reflected variations in the transcriptional regimes of individual bacteria. The broad host range of the vector/reporter platform is an asset for the characterization of promoters in different bacteria, thereby expanding the diversity of genomic chasses amenable to Synthetic Biology methods
Cascading signaling pathways improve the fidelity of a stochastically and deterministically simulated molecular RS latch
<p>Abstract</p> <p>Background</p> <p>While biological systems have often been compared with digital systems, they differ by the strong effect of crosstalk between signals due to diffusivity in the medium, reaction kinetics and geometry. Memory elements have allowed the creation of autonomous digital systems and although biological systems have similar properties of autonomy, equivalent memory mechanisms remain elusive. Any such equivalent memory system, however, must silence the effect of crosstalk to maintain memory fidelity.</p> <p>Results</p> <p>Here, we present a system of enzymatic reactions that behaves like an RS latch (a simple memory element in digital systems). Using both a stochastic molecular simulator and ordinary differential equation simulator, we showed that crosstalk between two latches operating in the same spatial localization disrupts the memory fidelity of both latches. Crosstalk was reduced or silenced when simple reaction loops were replaced with multiple step or cascading reactions, showing that cascading signaling pathways are less susceptible to crosstalk.</p> <p>Conclusion</p> <p>Thus, the common biological theme of cascading signaling pathways is advantageous for maintaining the fidelity of a memory latch in the presence of crosstalk. The experimental implementation of such a latch system will lead to novel approaches to cell control using synthetic proteins and will contribute to our understanding of why cells behave differently even when given the same stimulus.</p
Solving the chemical master equation using sliding windows
<p>Abstract</p> <p>Background</p> <p>The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a "window" into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.</p> <p>Results</p> <p>In order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.</p> <p>Conclusions</p> <p>The sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori.</p
A Genome-Wide Analysis of Promoter-Mediated Phenotypic Noise in Escherichia coli
Gene expression is subject to random perturbations that lead to fluctuations in the rate of protein production. As a consequence, for any given protein, genetically identical organisms living in a constant environment will contain different amounts of that particular protein, resulting in different phenotypes. This phenomenon is known as “phenotypic noise.” In bacterial systems, previous studies have shown that, for specific genes, both transcriptional and translational processes affect phenotypic noise. Here, we focus on how the promoter regions of genes affect noise and ask whether levels of promoter-mediated noise are correlated with genes' functional attributes, using data for over 60% of all promoters in Escherichia coli. We find that essential genes and genes with a high degree of evolutionary conservation have promoters that confer low levels of noise. We also find that the level of noise cannot be attributed to the evolutionary time that different genes have spent in the genome of E. coli. In contrast to previous results in eukaryotes, we find no association between promoter-mediated noise and gene expression plasticity. These results are consistent with the hypothesis that, in bacteria, natural selection can act to reduce gene expression noise and that some of this noise is controlled through the sequence of the promoter region alon
A Dominated Coupling From The Past algorithm for the stochastic simulation of networks of biochemical reactions
<p>Abstract</p> <p>Background</p> <p>In recent years, stochastic descriptions of biochemical reactions based on the Master Equation (ME) have become widespread. These are especially relevant for models involving gene regulation. Gillespie’s Stochastic Simulation Algorithm (SSA) is the most widely used method for the numerical evaluation of these models. The SSA produces exact samples from the distribution of the ME for finite times. However, if the stationary distribution is of interest, the SSA provides no information about convergence or how long the algorithm needs to be run to sample from the stationary distribution with given accuracy. </p> <p>Results</p> <p>We present a proof and numerical characterization of a Perfect Sampling algorithm for the ME of networks of biochemical reactions prevalent in gene regulation and enzymatic catalysis. Our algorithm combines the SSA with Dominated Coupling From The Past (DCFTP) techniques to provide guaranteed sampling from the stationary distribution. The resulting DCFTP-SSA is applicable to networks of reactions with uni-molecular stoichiometries and sub-linear, (anti-) monotone propensity functions. We showcase its applicability studying steady-state properties of stochastic regulatory networks of relevance in synthetic and systems biology.</p> <p>Conclusion</p> <p>The DCFTP-SSA provides an extension to Gillespie’s SSA with guaranteed sampling from the stationary solution of the ME for a broad class of stochastic biochemical networks.</p
Effects of bursty protein production on the noisy oscillatory properties of downstream pathways
Experiments show that proteins are translated in sharp bursts; similar bursty phenomena have been observed for protein import into compartments. Here we investigate the effect of burstiness in protein expression and import on the stochastic properties of downstream pathways. We consider two identical pathways with equal mean input rates, except in one pathway proteins are input one at a time and in the other proteins are input in bursts. Deterministically the dynamics of these two pathways are indistinguishable. However the stochastic behavior falls in three categories: (i) both pathways display or do not display noise-induced oscillations; (ii) the non-bursty input pathway displays noise-induced oscillations whereas the bursty one does not; (iii) the reverse of (ii). We derive necessary conditions for these three cases to classify systems involving autocatalysis, trimerization and genetic feedback loops. Our results suggest that single cell rhythms can be controlled by regulation of burstiness in protein production
Exploring the Contextual Sensitivity of Factors that Determine Cell-to-Cell Variability in Receptor-Mediated Apoptosis
Stochastic fluctuations in gene expression give rise to cell-to-cell variability in protein levels which can potentially cause variability in cellular phenotype. For TRAIL (TNF-related apoptosis-inducing ligand) variability manifests itself as dramatic differences in the time between ligand exposure and the sudden activation of the effector caspases that kill cells. However, the contribution of individual proteins to phenotypic variability has not been explored in detail. In this paper we use feature-based sensitivity analysis as a means to estimate the impact of variation in key apoptosis regulators on variability in the dynamics of cell death. We use Monte Carlo sampling from measured protein concentration distributions in combination with a previously validated ordinary differential equation model of apoptosis to simulate the dynamics of receptor-mediated apoptosis. We find that variation in the concentrations of some proteins matters much more than variation in others and that precisely which proteins matter depends both on the concentrations of other proteins and on whether correlations in protein levels are taken into account. A prediction from simulation that we confirm experimentally is that variability in fate is sensitive to even small increases in the levels of Bcl-2. We also show that sensitivity to Bcl-2 levels is itself sensitive to the levels of interacting proteins. The contextual dependency is implicit in the mathematical formulation of sensitivity, but our data show that it is also important for biologically relevant parameter values. Our work provides a conceptual and practical means to study and understand the impact of cell-to-cell variability in protein expression levels on cell fate using deterministic models and sampling from parameter distributions
- …