Modeling Networks of Coupled Enzymatic Reactions Using the Total Quasi-Steady State Approximation

In metabolic networks, metabolites are usually present in great excess over the enzymes that catalyze their interconversion, and describing the rates of these reactions by using the Michaelis–Menten rate law is perfectly valid. This rate law assumes that the concentration of enzyme–substrate complex (C) is much less than the free substrate concentration (S (0)). However, in protein interaction networks, the enzymes and substrates are all proteins in comparable concentrations, and neglecting C with respect to S (0) is not valid. Borghans, DeBoer, and Segel developed an alternative description of enzyme kinetics that is valid when C is comparable to S (0). We extend this description, which Borghans et al. call the total quasi-steady state approximation, to networks of coupled enzymatic reactions. First, we analyze an isolated Goldbeter–Koshland switch when enzymes and substrates are present in comparable concentrations. Then, on the basis of a real example of the molecular network governing cell cycle progression, we couple two and three Goldbeter–Koshland switches together to study the effects of feedback in networks of protein kinases and phosphatases. Our analysis shows that the total quasi-steady state approximation provides an excellent kinetic formalism for protein interaction networks, because (1) it unveils the modular structure of the enzymatic reactions, (2) it suggests a simple algorithm to formulate correct kinetic equations, and (3) contrary to classical Michaelis–Menten kinetics, it succeeds in faithfully reproducing the dynamics of the network both qualitatively and quantitatively

BlenX-based compositional modeling of complex reaction mechanisms

Molecular interactions are wired in a fascinating way resulting in complex behavior of biological systems. Theoretical modeling provides a useful framework for understanding the dynamics and the function of such networks. The complexity of the biological networks calls for conceptual tools that manage the combinatorial explosion of the set of possible interactions. A suitable conceptual tool to attack complexity is compositionality, already successfully used in the process algebra field to model computer systems. We rely on the BlenX programming language, originated by the beta-binders process calculus, to specify and simulate high-level descriptions of biological circuits. The Gillespie's stochastic framework of BlenX requires the decomposition of phenomenological functions into basic elementary reactions. Systematic unpacking of complex reaction mechanisms into BlenX templates is shown in this study. The estimation/derivation of missing parameters and the challenges emerging from compositional model building in stochastic process algebras are discussed. A biological example on circadian clock is presented as a case study of BlenX compositionality

Validity of the Michaelis–Menten equation – steady‐state or reactant stationary assumption: that is the question

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/102681/1/febs12564.pd

Cell Cycle Modeling for Budding Yeast with Stochastic Simulation Algorithms

For biochemical systems, where some chemical species are represented by small numbers of molecules, discrete and stochastic approaches are more appropriate than continuous and deterministic approaches. The continuous deterministic approach using ordinary differential equations is adequate for understanding the average behavior of cells, while the discrete stochastic approach accurately captures noisy events in the growth-division cycle. Since the emergence of the stochastic simulation algorithm (SSA) by Gillespie, alternative algorithms have been developed whose goal is to improve the computational efficiency of the SSA. This paper explains and empirically compares the performance of some of these SSA alternatives on a realistic model. The budding yeast cell cycle provides an excellent example of the need for modeling stochastic effects in mathematical modeling of biochemical reactions. This paper presents a stochastic approximation of the cell cycle for budding yeast using Gillespie’s stochastic simulation algorithm. To compare the stochastic results with the average behavior, the simulation must be run thousands of times. Many of the proposed techniques to accelerate the SSA are not effective on the budding yeast problem, because of the scale of the problem or because underlying assumptions are not satisfied. A load balancing algorithm improved overall performance on a parallel supercomputer

A graphical method for reducing and relating models in systems biology

Motivation: In Systems Biology, an increasing collection of models of various biological processes is currently developed and made available in publicly accessible repositories, such as biomodels.net for instance, through common exchange formats such as SBML. To date, however, there is no general method to relate different models to each other by abstraction or reduction relationships, and this task is left to the modeler for re-using and coupling models. In mathematical biology, model reduction techniques have been studied for a long time, mainly in the case where a model exhibits different time scales, or different spatial phases, which can be analyzed separately. These techniques are however far too restrictive to be applied on a large scale in systems biology, and do not take into account abstractions other than time or phase decompositions. Our purpose here is to propose a general computational method for relating models together, by considering primarily the structure of the interactions and abstracting from their dynamics in a first step

Universal features of cell polarization processes

Cell polarization plays a central role in the development of complex organisms. It has been recently shown that cell polarization may follow from the proximity to a phase separation instability in a bistable network of chemical reactions. An example which has been thoroughly studied is the formation of signaling domains during eukaryotic chemotaxis. In this case, the process of domain growth may be described by the use of a constrained time-dependent Landau-Ginzburg equation, admitting scale-invariant solutions {\textit{\`a la}} Lifshitz and Slyozov. The constraint results here from a mechanism of fast cycling of molecules between a cytosolic, inactive state and a membrane-bound, active state, which dynamically tunes the chemical potential for membrane binding to a value corresponding to the coexistence of different phases on the cell membrane. We provide here a universal description of this process both in the presence and absence of a gradient in the external activation field. Universal power laws are derived for the time needed for the cell to polarize in a chemotactic gradient, and for the value of the smallest detectable gradient. We also describe a concrete realization of our scheme based on the analysis of available biochemical and biophysical data.Comment: Submitted to Journal of Statistical Mechanics -Theory and Experiment

Biophysical assay for tethered signaling reactions reveals tether-controlled activity for the phosphatase SHP-1

Tethered enzymatic reactions are ubiquitous in signaling networks but are poorly understood. A previously unreported mathematical analysis is established for tethered signaling reactions in surface plasmon resonance (SPR). Applying the method to the phosphatase SHP-1 interacting with a phosphorylated tether corresponding to an immune receptor cytoplasmic tail provides five biophysical/biochemical constants from a single SPR experiment: two binding rates, two catalytic rates, and a reach parameter. Tether binding increases the activity of SHP-1 by 900-fold through a binding-induced allosteric activation (20-fold) and a more significant increase in local substrate concentration (45-fold). The reach parameter indicates that this local substrate concentration is exquisitely sensitive to receptor clustering. We further show that truncation of the tether leads not only to a lower reach but also to lower binding and catalysis. This work establishes a new framework for studying tethered signaling processes and highlights the tether as a control parameter in clustered receptor signaling

A systems model of phosphorylation for inflammatory signaling events

published_or_final_versio

Noise Propagation in Two-Step Series MAPK Cascade

Series MAPK enzymatic cascades, ubiquitously found in signaling networks, act as signal amplifiers and play a key role in processing information during signal transduction in cells. In activated cascades, cell-to-cell variability or noise is bound to occur and thereby strongly affects the cellular response. Commonly used linearization method (LM) applied to Langevin type stochastic model of the MAPK cascade fails to accurately predict intrinsic noise propagation in the cascade. We prove this by using extensive stochastic simulations for various ranges of biochemical parameters. This failure is due to the fact that the LM ignores the nonlinear effects on the noise. However, LM provides a good estimate of the extrinsic noise propagation. We show that the correct estimate of intrinsic noise propagation in signaling networks that contain at least one enzymatic step can be obtained only through stochastic simulations. Noise propagation in the cascade depends on the underlying biochemical parameters which are often unavailable. Based on a combination of global sensitivity analysis (GSA) and stochastic simulations, we developed a systematic methodology to characterize noise propagation in the cascade. GSA predicts that noise propagation in MAPK cascade is sensitive to the total number of upstream enzyme molecules and the total number of molecules of the two substrates involved in the cascade. We argue that the general systematic approach proposed and demonstrated on MAPK cascade must accompany noise propagation studies in biological networks