Single-variable reaction systems: deterministic and stochastic models.

Biochemical reaction networks are often described by deterministic models based on macroscopic rate equations. However, for small numbers of molecules, intrinsic noise can play a significant role and stochastic methods may thus be required. In this work, we analyze the differences and similarities between a class of macroscopic deterministic models and corresponding mesoscopic stochastic models. We derive expressions that provide a clear and intuitive view upon the behavior of the stochastic model. In particular, these expressions show the dependence of both the dynamics and the stationary distribution of the stochastic model on the number of molecules in the system. As expected, most properties of the stochastic model correspond well with those in the deterministic model if the number of molecules is large enough. However, for some properties, both models are inconsistent, even if the number of molecules in the stochastic model tends to infinity. Throughout this paper, we use a bistable autophosphorylation cycle as a running example. For such a bistable system, we give an explicit proof that the rate of convergence to the stationary distribution (or the second eigenvalue of the transition matrix) depends exponentially on the number of molecules.

Computing the stochastic dynamics of phosphorylation networks.

Cells of all organisms share the ability to respond to various extracellular signals. Depending on the cell type and the organism, these signals may include hormones secreted by other cells or changes in nutrient concentrations. The signals are processed by an intricate network of protein-protein interactions, including phosphorylation and de-phosphorylation events. As some signaling proteins are only present in low concentrations, random fluctuations may affect the dynamics of the network. The mathematical modeling of networks with significant random fluctuations requires the use of stochastic methods. The stochastic dynamics of a chemical reaction system are described by the Chemical Master Equation. Often the numerical evaluation of this equation is problematic. The first problem is that many systems have an infinite number of possible states; leaving simulations of individual trajectories as the only alternative. To circumvent this problem, we focus on a class of systems that have a finite state space. More specifically, we focus on networks of phosphorylation cycles without taking into account the synthesis and degradation of proteins. The second problem is that memory requirements cause a practical limit to the size of systems that can be evaluated. In this paper, we discuss how these limitations can be overcome using parallel computation and methods dealing efficiently with the available memory. These methods were implemented in a parallel C++ program. We discuss two networks for which the stochastic dynamics were evaluated using this program: a single phosphorylation cycle and an oscillating MAP-kinase cascade.

Computing algebraic functions with biochemical reaction networks.

In biological organisms, networks of chemical reactions control the processing of information in a cell. A general approach to study the behavior of these networks is to analyze common modules. Instead of this analytical approach to study signaling networks, we construct functional motifs from the bottom up. We formulate conceptual networks of biochemical reactions that implement elementary algebraic operations over the domain and range of positive real numbers. We discuss how the steady state behavior relates to algebraic functions, and study the stability of the networks' fixed points. The primitive networks are then combined in feed-forward networks, allowing us to compute a diverse range of algebraic functions, such as polynomials. With this systematic approach, we explore the range of mathematical functions that can be constructed with these networks.