# A model reduction method for biochemical reaction networks

- Shodhan Rao
^{1, 3, 4}, - Arjan van der Schaft
^{1, 2}, - Karen van Eunen
^{1, 3}, - Barbara M Bakker
^{1, 3}and - Bayu Jayawardhana
^{1, 4}Email author

**8**:52

https://doi.org/10.1186/1752-0509-8-52

© Rao et al.; licensee BioMed Central Ltd. 2014

**Received: **29 October 2013

**Accepted: **23 April 2014

**Published: **3 May 2014

## Abstract

### Background

In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model.

### Results

We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%.

### Conclusions

The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse-grained yet realistic environment.

## Keywords

## Background

A kinetic model of a biochemical reaction network consists of a set of ordinary differential equations describing the dynamics of the concentrations of all metabolites in the reaction network. Most biochemical reaction networks are complex and involve many enzyme-catalyzed processes with non-linear kinetics and intricate stoichiometric and regulatory interactions between the enzymes. Consequently, the mathematical models of such networks contain high-dimensional sets of coupled rational differential equations, which sometimes require huge computational effort to analyze. The current state-of-the-art numerical tools for stability analysis, for bifurcation study and for other types of dynamical analysis are known to suffer from a so-called *curse-of-dimensionality*. For example, the largest biological model that has numerically been analyzed for bifurcation in[1] consists of 25 metabolites and 37 parameters and the one in[2] has 22 metabolites. Moreover since complex models of biochemical reaction networks involve a huge number of parameters, the task of identifying these parameters (in addition to those parameters that have been identified in the literature) is enormous and requires large datasets. The complexity of this task is further compounded by the fact that often not all the metabolite concentrations can be measured. Thus, there is a need for techniques that can reduce a given kinetic model of a biochemical reaction network to a simplified version that mimics the behaviour of the original model satisfactorily, but contains less differential equations and parameters.

For biochemical reaction networks, a number of model reduction techniques are known. See[3] for a detailed review of some of the well known methods of model reduction. Here we list only a few of the known methods in the literature. The singular perturbation method, the time-scale separation technique[4–8], the rapid-equilibrium approximation, also known as the quasi-equilibrium approximation (see[9]) and the quasi steady-state approximation (QSSA) (see for e.g.,[10]) are the most commonly used techniques. The reduced state vector obtained by any of these techniques contains a subset of the metabolite concentrations (state vector components) of the full model. Härdin[11] extends the QSSA approach by considering the higher-order approximation in the computation of the quasi steady-state. In[12], some approaches for reduction of complexity in biochemical reaction networks are considered for use in SYCAMORE, which is a computational research environment in systems biology. One of the approaches considered in[12] is the intrinsic low-dimensional manifold (ILDM) approach, which is an improved time-scale separation technique. More recently[13], a computational singular perturbation (CSP) algorithm was developed to analyze the time-scales of the NF- *κ* B signaling network which could be used in order to reduce its model. The application of singular perturbation, time-scale separation, quasi equilibrium and quasi steady state approaches to general enzyme-kinetic rate laws, such as Michaelis-Menten and ping-pong bi-bi is difficult and leads to complicated rate law expressions in the reduced models. Some of the time-scale separation techniques are either based on a priori experimental information or eigenvalues of the Jacobian corresponding to the model and hence are only locally effective. Another recent approach for model reduction uses tropical geometry (see e.g.,[14]), wherein the polynomial occuring in every rate equation is replaced by a monomial which is equal to the largest, in absolute value among the monomials that constitute the polynomial.

One of the ways of reducing the complexity of a biochemical model is to reduce the number of parameters in it. This can be done by carrying out a parameter sensitivity analysis (see for e.g.,[15]) and eliminating those parameters whose variations have least effect on the dynamics of a given network. In[8], a time-scale analysis is first done using experimental data to identify the fast and the slow metabolites and this information is then used to carry out an *a priori* parameter sensitivity analysis to obtain a reduced kinetic model of a biochemical reaction network. In[16], an implicit multiparametric variability analysis (MPVA) method is used to search the entire parameter space in order to determine the set of parameters that can be eliminated. In[17], the authors go one step further by identifying a region in the parameter space where some of the parameters are zero-valued, others have readjusted values and where nevertheless the outputs of the original model match those of the reduced model within a certain tolerance. They further show that parameter sensitivity analysis approach for model reduction may not be always successful. Another way of reducing the complexity of a biochemical reaction network model is to reduce the number of reactions. In[18–20], optimization techniques are used to determine which reactions can be eliminated from the original model without a substantial alteration of the model behaviour.

The method proposed in[21] simplifies a given chemical reaction network by linearly combining reactions in such a way that the resulting network has lesser number of species. However, the kinetics for the reduced set of reactions are determined by the rate limiting steps in the original network and this requires prior biological knowledge of the network. Danø *et al.*[22] propose reduction by identification and elimination of variables in such a way that the basic dynamic properties of the original model are preserved. In[23], model reduction is achieved by simplifying the rate equations of individual enzymes in the network. A limitation of this method is that it yields a reduced model that predicts measurement data only under specific experimental conditions.

In this paper, we describe a new model reduction method that reduces the number of reactions, metabolites and parameters, such that the dynamics of the metabolite concentrations of the reduced model are close to those of the original model. This method proceeds by a simple stepwise reduction in the number of ‘complexes’, which are defined as the left and right-hand sides of the reactions in the network. The effect of this stepwise reduction is monitored by an error integral, which quantifies how much the behaviour of the reduced model deviates from the original. The method is based on the reduction of the underlying weighted Laplacian (see[24] for a definition) describing the graph structure of the complexes and reactions in the chemical reaction network. A similar technique is also employed in the Kron reduction method for reduction of resistive electrical network models[25].

Our model reduction technique is easy to implement and can be used to reduce reaction networks governed by a vast majority of enzyme kinetic rate laws including Hill kinetics and reversible Michaelis-Menten kinetics. It does not rely on prior knowledge about the dynamic behaviour or biological function of the network. Consequently, it can be automated. Furthermore, the reduced model largely retains the kinetics and structure of the original model. This enables a direct biochemical interpretation and yields insight into which parts of the network have the highest influence on its behaviour. It also accelerates computations and facilitates parameter fitting, especially when we deal with models of huge biochemical reaction networks.

We show the application of our model reduction technique to a yeast glycolysis model[26] and a model of beta-oxidation in rat liver[27]. We have simulated the transient behaviour of the metabolites that are not eliminated during the model reduction procedure. In both the cases, a 30% reduction of the number of variables still retained about 92.5–96.5% agreement between the outputs of the full and the reduced networks.

## Methods

### Preliminaries

Notation: The space of *n* dimensional real vectors is denoted by${\mathbb{R}}^{n}$, and the space of *m*×*n* real matrices by${\mathbb{R}}^{m\times n}$. The space of *n* dimensional real vectors consisting of all strictly positive entries is denoted by${\mathbb{R}}_{+}^{n}$. *I*
_{
n
} denotes an identity matrix of dimension *n*. The transpose of a matrix *A* is denoted by *A*
^{
T
}. Define the mapping$\text{Ln}:{\mathbb{R}}_{+}^{m}\to {\mathbb{R}}^{m},\phantom{\rule{1em}{0ex}}x\mapsto \text{Ln}\left(x\right),$ as the mapping for which the *i*-th component is given by (Ln(*x*))_{
i
}:=ln(*x*
_{
i
}). Similarly, define the mapping$\text{Exp}:{\mathbb{R}}^{m}\to {\mathbb{R}}_{+}^{m},\phantom{\rule{1em}{0ex}}x\mapsto \text{Exp}\left(x\right)$, as the mapping for which the *i*-th component is given by (Exp(*x*))_{
i
}:=exp(*x*
_{
i
}).${\mathbb{1}}_{m}$ denotes a vector of dimension *m* with all entries equal to 1 and dim(*V*) denotes the dimension of a set *V*.

#### Chemical reaction network structure

In this section, we introduce the concept of a complex graph which was first introduced in the work of Horn & Jackson and Feinberg[28–30]. This concept will be used first in deriving our general mathematical formulation of the dynamics of chemical reaction networks, and subsequently to explain our model reduction approach.

*m*,

*c*and

*r*denote the number of species (metabolites), complexes and reactions respectively of a given chemical reaction network. The set of complexes of a network is simply defined as the union of all the different left- and righthand sides (substrates and products) of the reactions in the network. Thus, the complexes corresponding to the network in Figure1 are 2

*X*

_{1}+

*X*

_{2},

*X*

_{3},

*X*

_{1}+2

*X*

_{2}and

*X*

_{4}.

*m*×

*c*matrix

*Z*, whose

*α*-th column captures the expression of the

*α*-th complex in the

*m*chemical species. For example, for the network depicted in Figure1,

The matrix *Z* is called the *complex stoichiometric matrix* of the network. Note that by definition all elements of the matrix *Z* are non-negative integers.

Since complexes are the left- and righthand sides of reactions in the network, they can be naturally associated with the vertices of a *directed graph*
with edges corresponding to the reactions. Formally, the reaction *α*→*β* between the *α*-th (reactant) and the *β*-th (product) complexes defines a directed edge with tail vertex being the *α*-th complex and head vertex being the *β*-th complex. The resulting graph will be called the *complex graph*.

Any graph is defined by its *incidence matrix* *B*[24]. This is a *c*×*r* matrix, where *c* denotes the number of vertices, *r* denotes the number of edges and the (*α*,*j*)-th element is equal to -1 if vertex *α* is the tail vertex of edge *j* and 1 if vertex *α* is the head vertex of edge *j*, while 0 otherwise.

The basic structure underlying the dynamics of the vector$x\in {\mathbb{R}}_{+}^{m}$ of concentrations *x*
_{
i
},*i*=1,⋯,*m*, of the species of a chemical reaction network is given by the *balance laws*
$\stackrel{\u0307}{x}=\mathit{\text{ZBv}}\left(x\right)$; the elements of the vector$v\in {\mathbb{R}}^{r}$ are commonly called the (reaction) *rates* or *fluxes*.

*open*, in the sense that there is a continuous exchange with the environment (in particular, inflow and outflow of chemical species and connection to other reaction networks). In this paper, we are particularly interested in inflows to and outflows from the complexes of the network. This will be modeled by a vector${v}_{b}\left(x\right)\in {\mathbb{R}}^{c}$ consisting of

*c*

*boundary*(or, exchange)

*fluxes*, leading to an extended model

A *linkage class* of a chemical reaction network is a maximal set of complexes$\{{\mathcal{C}}_{1},\dots ,{\mathcal{C}}_{k}\}$ such that${\mathcal{C}}_{i}$ is connected by reactions to${\mathcal{C}}_{j}$ for every *i*,*j*∈{1,…,*k*}, *i*≠*j*.

#### General kinetics

For a biochemical reaction network, the relation between the reaction rates and species concentrations depends on the mechanisms of the reactions involved in the network. In this section, we derive a framework for describing the dynamics of enzymatic reaction networks using the aforementioned notion of complex graphs in a reaction network. This framework will be useful in describing our model reduction method. We describe the forward and reverse rates of an enzyme with separate equations.

*Z*corresponding to the substrate complex${\mathcal{S}}_{j}$ of the

*j*-th reaction of a chemical reaction network. Then the unidirectional, forward reaction rate of the

*j*

^{th}reaction of the chemical reaction network between the substrate complex${\mathcal{S}}_{j}$ and the product complex${\mathcal{P}}_{j}$ is given by

where for *j*=1,…,*r*,${d}_{j}:{\mathbb{R}}_{+}^{m}\to {\mathbb{R}}_{+}$ is a rational function of its argument and *k*
_{
j
} denotes a proportionality constant of the *j*
^{th} reaction of the network. Note that if the governing law of the *j*
^{th} reaction is *mass action kinetics*, then *d*
_{
j
}(*x*)=1.

*i*=1,…,4, let

*x*

_{ i }denote the concentration of the species

*X*

_{ i }and define

*x*:=[

*x*

_{1}

*x*

_{2}

*x*

_{3}

*x*

_{4}]

^{ T }. In this example, the substrate complex

*S*is

*X*

_{1}+

*X*

_{2}and the product complex

*P*is

*X*

_{3}+

*X*

_{4}. The matrices

*B*and

*Z*for the reaction (3) are given by

*K*

_{1},

*K*

_{2},

*K*

_{3}and

*K*

_{4}denote the “Michaelis” constants of the species

*X*

_{1},

*X*

_{2},

*X*

_{3}and

*X*

_{4}respectively. Let

*V*

_{ f }denote the maximum rate of the forward reaction (3). The expression for the rate of the reaction (3) depends on the type and mechanism of the reaction, for instance the type of inhibition and other regulatory mechanisms involved in the reaction. One possibility is

*d*satisfying$d:{\mathbb{R}}_{+}^{m}\to {\mathbb{R}}_{+}$. Note that the form (2) is retained with a

*d*satisfying$d:{\mathbb{R}}_{+}^{m}\to {\mathbb{R}}_{+}$ even if there are competitive, non-competitive or uncompetitive modifiers in the reaction network. This is because the terms containing the concentration of the modifiers appear in the denominator of the rate expression in such a way that the denominator assumes positive values for positive values of concentrations of the substrates. For example, if we consider the reaction

*X*

_{1}denoted by

*K*

_{1}and the maximum reaction rate denoted by

*V*, then

*I*whose concentration is denoted by

*i*and whose inhibition coefficient is denoted by

*K*

_{ i }. Then the rate of the reaction is given by

*k*defined as earlier and$d\left(x\right):={\left(1+\frac{{x}_{1}}{{K}_{1}}+\frac{i}{{K}_{i}}\right)}^{-1}$ observe that (7) has the same form as (2) and$d:{\mathbb{R}}_{+}^{2}\to {\mathbb{R}}_{+}$. Similarly if

*I*is a non-competitive modifier, then

*d*satisfying$d:{\mathbb{R}}_{+}^{2}\to {\mathbb{R}}_{+}$. If

*I*denotes an uncompetitive modifier, then

denotes the rate of the reaction which can be written in the form (2) with a *d* satisfying$d:{\mathbb{R}}_{+}^{2}\to {\mathbb{R}}_{+}$.

*σ*,

*π*∈{1,…,

*c*}, define

*σ*→

*π*, then

*a*

_{ π σ }=0. Define the

*weighted adjacency matrix*

*A*of the complex graph as the matrix with (

*σ*,

*π*)-th element

*a*

_{ σ π }, where

*σ*,

*π*∈{1,⋯,

*c*}. Furthermore, define

*L*(

*x*):=

*Δ*(

*x*)-

*A*(

*x*), where

*Δ*is the diagonal matrix whose (

*ρ*,

*ρ*)-th element is equal to the sum of the elements of the

*ρ*-th column of

*A*. Hereafter we refer to

*L*(

*x*) as the

*weighted Laplacian*of the complex graph associated with the given network with species concentration vector

*x*. It can be verified that the sum of the elements of each column of

*L*is equal to zero and that the vector

*B*

*v*(

*x*) is equal to -

*L*(

*x*)Exp(

*Z*

^{ T }Ln(

*x*)). From equation (1), it follows that the dynamics of enzymatic chemical reaction networks can be compactly written as

A similar expression of the dynamics corresponding to mass action kinetics, in less explicit form, was obtained in[31]. Note that although in equation (8), Exp(*Z*
^{
T
}Ln(*x*)) is not defined if some of the components of *x* are equal to zeros, the limit at such an *x* exists and is used in equation (8) whenever some of the components of *x* are equal to zero.

### Model reduction

For many purposes one may wish to reduce the number of dynamical equations of a chemical reaction network in such a way that the behaviour of a number of key metabolites is approximated in a satisfactory way. We propose a novel method for model reduction of chemical reaction networks governed by enzyme kinetics. Our method is inspired by the Kron reduction method for model reduction of resistive electrical networks described in[25]; see also[32].

#### Description of the method

*reduction of the complex graph*associated with the network. Let denote the set of vertices of the complex graph. Reduction of the model is carried out by

*deleting certain complexes in the complex graph*, resulting in a reduced complex graph. Deletion of a complex is equivalent to imposing the complex balancing condition on it, i.e., the condition that the net inflow into the complex is equal to the net outflow from it. Consider a subset${\mathcal{V}}_{o}\subset \mathcal{V}$ of dimension$c-\u0109$ that we wish to delete in order to reduce the model. Consider a partition of

*L*(

*x*) given by

*Z*and

*v*

_{ b }given by

*L*(

*x*) with respect to the indices corresponding to${\mathcal{V}}_{o}$. Consider now the auxiliary dynamical system

Note that the reduced model is independent of the order of deletion of complexes. From the following Proposition, it follows that$\widehat{L}\left(x\right)$ satisfies all the properties of a weighted Laplacian matrix of a reaction network corresponding to a complex graph with vertex set$\mathcal{V}-{\mathcal{V}}_{o}$

#####
**Proposition** **1**.

*x*. Let denote the set of vertices of the complex graph associated with the network. Then for any subset of vertices${\mathcal{V}}_{r}\subset \mathcal{V}$, the Schur complement$\widehat{L}\left(x\right)$ of

*L*(

*x*) with respect to the indices corresponding to${\mathcal{V}}_{r}$ satisfies the following properties:

##### Proof

*1*.) Follows from the proof of ([33], Theorem 3.11); see also[32] for the case of symmetric

*L*. (

*2*.) Without loss of generality, assume that the last$c-\u0109$ rows and columns of

*L*(

*x*) correspond to the vertex set${\mathcal{V}}_{r}$. Consider a partition of

*L*(

*x*) given by

□

This proves that (9) describes the dynamics of a *chemical reaction network* governed by enzyme kinetics, with a reduced number of complexes and with, in general, a different set of boundary fluxes and reactions (edges of the complex graph). An appropriate choice of
will ensure that some of the elements of *x* have derivative zero in (9) leading to a reduced number of state variables.

The principle behind our model reduction method is to couple the dynamics of certain complexes to the dynamics of the neighbouring complexes or the complexes with which they are connected by reactions. This is done by complex balancing or by equating the net rate of inflow into the complex to the net rate of outflow from it. Note that for a reasonably good model reduction, it is important to make the right choice of complexes to be deleted. In the next section, we describe a procedure for making the choice of complexes to be deleted. Below, we illustrate our complex balancing procedure for model reduction with the help of an example.

##### Example 1

*i*=1,…,6, let

*x*

_{ i }denote the concentration of

*X*

_{ i }. For

*i*=1,…,4, let${K}_{\mathrm{m}}^{\mathrm{I},i}$ denote the Michaelis constant of

*X*

_{ i }for the first reversible reaction. For

*i*=3,…,6, let${K}_{\mathrm{m}}^{\mathit{\text{II}},i}$ denote the Michaelis constant of

*X*

_{ i }for the second reversible reaction. Let${k}_{f}^{\mathrm{I}}$ and${k}_{r}^{\mathrm{I}}$ denote the forward and reverse rate constants of the first reaction and let${k}_{f}^{\mathit{\text{II}}}$ and${k}_{r}^{\mathit{\text{II}}}$ denote the respective rate constants of the second reaction. Note that${k}_{f}^{\mathrm{I}}:=\frac{{V}_{f}^{\mathrm{I}}}{{K}_{\mathrm{m}}^{\mathrm{I},1}{K}_{\mathrm{m}}^{\mathrm{I},2}}$ where${V}_{f}^{\mathrm{I}}$ denotes the maximum rate of the first reversible reaction in the forward direction and the other rate constants are similarly defined. Define

*x*:=[

*x*

_{1}

*x*

_{2}…

*x*

_{6}]

^{ T },

*v*

_{1f },

*v*

_{1r }denote the reaction rates in the forward and the reverse directions respectively of the first reversible reaction and

*v*

_{2f },

*v*

_{2r }similarly denote those of the second reversible reaction. If${K}_{\mathit{\text{eq}}}^{\mathrm{I}}$ and${K}_{\mathit{\text{eq}}}^{\mathit{\text{II}}}$ denote the equilibrium constants of the first and the second reversible reactions respectively, then

*X*

_{3}+

*X*

_{4}from the network (11). Applying the procedure described in this section, we first assume that the rate of inflow to the complex

*X*

_{3}+

*X*

_{4}is equal to the rate of outflow from it, i.e.

*v*

_{1f }-

*v*

_{1r }=

*v*

_{2f }-

*v*

_{2r }. This yields

*v*in the forward direction of the reduced network:

*p*

_{1}and

*p*

_{2}in the right hand side of the above equation, we fix

*x*

_{3}and

*x*

_{4}at their initial values to obtain the following expression for

*v*.

*x*

_{3}and

*x*

_{4}. We remark here that the resulting equation (13) has again the form of an enzyme kinetic rate equation and the rates in the forward and reverse directions can be written in the form of equation (2) with a

*d*satisfying$d:{\mathbb{R}}_{+}^{4}\to {\mathbb{R}}_{+}$. If${K}_{\mathit{\text{eq}}}^{\mathit{\text{red}}}$ denotes the equilibrium constant for the reduced network, then observe that

For this example, our procedure yields a reduced model with 8 parameters while the original model has 12 parameters. Moreover while the original model has 2 reactions and 6 state variables, the reduced model has 1 reaction and 4 state variables.

#### Error integral

We now describe an automated procedure for making the choice of complexes to be deleted in such a way that the dynamic behaviour of the reduced model is close to that of the original model. We quantify the difference between the dynamical behaviour of the original and the corresponding reduced model under the conditions of a specific dynamic event by an error integral, as defined in this section.

*T*] is the time interval over which we are interested to observe the difference between the behaviours of the full and the reduced model. We define the error integral (

*I*) as

where *x*
_{
i
r
}(*t*) and *x*
_{
i
f
}(*t*) denote the concentrations of the *i*
^{th} metabolite of the reduced and the full model respectively at time *t*. Observe that *I* is dimensionless. The value of *I* indicates the deviation of the reduced model from the full model averaged over time and species.

In order to reduce a given model of a biochemical reaction network, we first determine the steady state concentration of each of the metabolite of the network. Then we rank the complexes to be deleted according to the error integrals corresponding to the reduced model with the respective complex deleted and with the initial values of concentrations of the species of the deleted complexes set at their steady state values. We then make the deletion that leads to the smallest value of *I*. With the reduced model, we then repeat this procedure. Thus we follow an iterative procedure with each iteration consisting of two steps: ranking of complexes to be deleted and deletion of the complex which leads to the smallest error integral. We stop the iteration when the error integral of the reduced model obtained at the end of an iteration exceeds a certain cut-off value. The reduced model obtained at the end of the previous iteration is then considered as the final reduced model.

For the two biochemical models considered in this paper, namely the yeast glycolysis model and the rat-liver fatty acid beta-oxidation model, the cut-off value of the error integral for stopping the iterative model reduction procedure has been set at 0.1. In general, this cut-off value can be set according to the desired closeness of the reduced model to the original.

#### Difference with QSSA

*Z*is an identity matrix, as shown in the following example. Consider the reaction network

*i*=1,2,3, let

*x*

_{ i }denote the concentration of

*X*

_{ i }. For

*i*=1,2, let${K}_{\mathrm{m}}^{\mathrm{I},i}$ denote the Michaelis constant of

*X*

_{ i }for the first reversible reaction. For

*i*=2,3, let${K}_{\mathrm{m}}^{\text{II},i}$ denote the Michaelis constant of

*X*

_{ i }for the second reversible reaction. Let${k}_{f}^{\mathrm{I}}$ and${k}_{r}^{\mathrm{I}}$ denote the forward and reverse rate constants of the first reaction and let${k}_{f}^{\text{II}}$ and${k}_{r}^{\text{II}}$ denote the respective rate constants of the second reaction. Note that${k}_{f}^{\mathrm{I}}:=\frac{{V}_{f}^{\mathrm{I}}}{{K}_{\mathrm{m}}^{\mathrm{I},1}}$ where${V}_{f}^{\mathrm{I}}$ denotes the maximum rate of the first reversible reaction in the forward direction and the other rate constants are similarly defined. Define

*X*

_{2}attains rapid steady state which, as in the previous example, implies that

*x*

_{2}from the resulting quadratic equation given by

*f*be a function of two variables such that

*x*

_{2}=

*f*(

*x*

_{1},

*x*

_{3}) defines an admissible (real and positive) solution of the above equation. Then the resulting reaction rate in the forward direction (

*v*) of the reduced network

as the overall reaction rate in the forward direction of the reduced network (15).

*X*

_{3}attains rapid equilibrium, application of QSSA is more complicated as compared to the previous case as it involves solution of a quartic equation. On the other hand, our method leads to a simple expression for the overall reaction rate in the forward direction (

*v*) of the reduced network

When the complex to be deleted in a reaction network is made up of more than one species, QSSA cannot be applied in some cases. Example 1 is one such case. With reference to this example, using equation (12), one needs to solve for *x*
_{3} and *x*
_{4} in order to apply QSSA. However, this is not possible as there is one equation and two unknowns *x*
_{3} and *x*
_{4} to be solved for. Thus our model reduction method is more effective in dealing with deletion of complexes made up of more than one species.

#### Effect of model reduction

In this section, we show the graph restructuring of our reduced model in terms of its corresponding full model for three particular types of linkage classes of biochemical reaction networks. Note that the deletion of a set of complexes in one linkage class does not affect the mathematical models of the reactions of the other linkage classes of the network.

**Type 1 linkage class:**

Consider a linkage class with reversible reactions occuring between consecutive elements of the set of distinct complexes$\{{\mathcal{C}}_{1},{\mathcal{C}}_{2},\dots ,{\mathcal{C}}_{n}\}$ as in (16). The reduced network obtained by deleting the complex${\mathcal{C}}_{2}$ is given by (17), where the two reversible reactions,${\mathcal{C}}_{1}\rightleftharpoons {\mathcal{C}}_{2}$ and${\mathcal{C}}_{2}\rightleftharpoons {\mathcal{C}}_{3}$ of the full network are replaced by a reversible reaction${\mathcal{C}}_{1}\rightleftharpoons {\mathcal{C}}_{3}$ in the reduced network. If the kinetics of the reactions${\mathcal{C}}_{1}\rightleftharpoons {\mathcal{C}}_{2}$ and${\mathcal{C}}_{2}\rightleftharpoons {\mathcal{C}}_{3}$ are of the same type, the reaction${\mathcal{C}}_{1}\rightleftharpoons {\mathcal{C}}_{3}$ of the reduced network has the same kinetics. This has been shown for a particular type of reactions in Example 1. The rate equations of all the remaining reactions of the reduced network are the same as those of the full network.

Deletion of the complex${\mathcal{C}}_{2}$ in this case is equivalent to deletion of the linkage class from the network. Such a deletion provides a close approximation to the original network if the reaction (18) has very little effect on the dynamics of the network.

**Type 2 linkage class:**

In this type of a linkage class, we have one complex${\mathcal{C}}_{2}$ involved in both a reversible reaction and an irreversible reaction as shown in (19) and (21). The reversible and the irreversible reactions in which${\mathcal{C}}_{2}$ is involved in the full network are replaced with a single irreversible reaction in the reduced network as in (20) and (22). The deletion of${\mathcal{C}}_{2}$ does not affect the mathematical description of the remaining reactions of the linkage class. As with the previous type of linkage class, if the kinetics of the reversible and irreversible reactions of the full network are of the same type, the reaction${\mathcal{C}}_{1}\to {\mathcal{C}}_{3}$ of the reduced network has the same kinetics.

In this type of linkage classes, we have a complex that is involved in more than two reactions as the one shown in (23). In this example, if we delete the complex${\mathcal{C}}_{2}$, we arrive at the reduced network shown in (24). This deletion has no effect on the mathematical description of the remaining part of the network. Similar to the previous type of linkage classes, the reduced model of this type of a linkage class inherits the kinetics of the full model.

Notice that though the number of complexes in the reduced network is less than that of the original network, the number of reactions is the same in both. The reaction constants of reaction 4 of the reduced network depends on the reaction constants of reactions 1 and 2 of the full network; those of reaction 5 depend on those of reactions 1 and 3 and those of reaction 6 depend on those of reactions 2 and 3. Furthermore, deletion of the complex${\mathcal{C}}_{2}$ in this case does not lead to a reduction in the number of parameters.

In the next section, we show the application of our model reduction method on a yeast glycolysis model and a beta oxidation model in rat liver. In both these cases, we encounter linkage classes belonging to one of the three types mentioned above.

## Results and discussion

### Yeast Glycolysis model

- 1.
uptake of extracellular glucose (Glco) into the cell;

- 2.
conversion of trehalose into intracellular glucose (Glci);

- 3.
production of trehalose from glucose 6-phosphate (G6P);

- 4.
production of glycerol from TRIO (TRIO is a pool summing up dihydroxyacetone phosphate and glyceraldehyde 3-phosphate);

- 5.
production of succinate from pyruvate (PYR);

- 6.
production of acetate from acetaldehyde (AcAld);

- 7.
production of ethanol from AcAld.

*t*<0 and

*t*≥0 respectively, and as observed experimentally the corresponding concentrations of ATP are equal to 5 mM and 2.5 mM. It is assumed that the network is at steady state for

*t*<0. It is found that the model is asymptotically stable. The reactions of the network are governed by enzyme kinetics and we can write the equations of the model in the same form as equation (8). The set of significant species$\left({\mathcal{\mathcal{M}}}_{\mathrm{I}}\right)$ for the model consists of Glci, TRIO, BPG, PYR, AcAld and NADH. Figure3 depicts the minimum error integrals as a function of the number of deleted complexes. Since deletion of a sixth complex leads to the error integral exceeding 0.1 in value, we stop the model reduction process after deletion of five complexes. The order of deletion is F6P, G6P, 2-phosphoglycerate (P2G), 3-phosphoglycerate (P3G) and phosphoenoylpyruvate (PEP). Deletion of P3G and P2G produces the same effect as the deletion of complex${\mathcal{C}}_{2}$ from a type 1 linkage class as described in the section on model reduction. Deletion of each of the remaining complexes produces the same effect as the deletion of complex${\mathcal{C}}_{2}$ from a type 2 linkage class. Each deletion results in the shortening of the chain length of the linkage class to which the complex belongs (see Figure2, right-hand panel).

It is observed that there is a good agreement between the transient behaviours of most of the metabolites when comparing the original model to the reduced model with five complexes deleted. The main reason for this is that the reactions of the original model that are missing in the reduced one (see Figure2) are the close-to-equilibrium reactions of the network. The concentration of F16BP has a strong effect on enzyme rates, both locally on the reactions in which it is involved, and distantly on the rate of pyruvate kinase (PYK). Together, this provides a clear explanation why F16BP ends up last in the order of complexes to be deleted (see Figure3). The table of Figure3 gives the convergence times of the six metabolites (complexes) that were considered for deletion. These are the times that it takes for the metabolite concentrations to achieve 95% of their concentration change going from one steady state to the other. Observe that the order of deletion of the complexes is not the same as the increasing order of their convergence times.

### Fatty acid beta-oxidation model

*β*-ketothiolase (MCKAT) and mitochondrial trifunctional protein (MTP), the carbon chain length of each molecule of acyl CoA is shortened by 2 at the same time producing one molecule of acetyl CoA.

The carbon chain-lengths of the compounds processed by each of these enzymes is indicated within the ellipses. The full model has 42 state variables, 160 parameters and 56 reactions. The mathematical model is first written in the form (8). It is found that the model is asymptotically stable. At steady state, each enzyme has a constant reaction flux (rate).

By making use of the biochemical knowledge of the beta oxidation model, an initial reduction of the beta oxidation model has been performed as described below. This procedure holds only for this particular model and is not obtained by an automated deletion of complexes. It can be seen from Figure5 that certain acyl CoAs having the same carbon chain lengths can be dehydrogenated by multiple enzymes, for example C8 acyl CoA can be dehydrogenated by three enzymes MCAD, LCAD or VLCAD. By checking the steady state fluxes of the same reaction through these different enzymes, we can reduce the model. For example, we found that the flux of dehydrogenation of C6 acyl CoA by MCAD is 99 times that by SCAD. Thus the model can be reduced by assuming that C6 acyl CoA is dehydrogenated by MCAD alone and not by SCAD. Similarly, we found that the model can be further reduced by assuming that C4 acyl CoA is dehydrogenated by SCAD alone and C8 acyl CoA is dehydrogenated by MCAD alone as the dehydrogenation fluxes of these compounds via other enzymes is comparatively very low.

Subsequently, we performed a further reduction of the beta oxidation model by deletion of certain complexes according to the procedure described earlier. It can be seen from Figure5 that the shortening of chain length of acyl CoAs of chain lengths 16, 14, 12, 10 and 8 can happen via two routes, i.e. either via the enzyme MTP or via the sequence of enzymes crotonase, M/SCHAD and MCKAT. Deletion of the complexes hydroxyacyl and ketoacyl CoAs of even chain lengths between 8 and 16 is equivalent to having all acyl CoAs of chain lengths 8 till 16 reduced by only the first route. It is found that such a deletion produces a reduced model which has a very similar transient behaviour as the full model. The observation that the steady state fluxes through the first route is about a hundred times larger than the steady state fluxes through the second route explains the fact that removal of the second route does not have much effect on the dynamics of the rest of the system.

Note that the shortening of chain length of acyl CoAs of chain lengths 6 and 4 happens only via the sequence of enzymes crotonase, M/SCHAD and MCKAT. It is found that the combined effect of enzymes crotonase and M/SCHAD can be produced by a single fictitious enzyme which we have termed as CRMS. This is done by deleting the complexes C4 hydroxyacyl CoA and C6 hydroxyacyl CoA. Again such a deletion has a negligible effect on the dynamics of the rest of the system.

Each of the 12 deletions of complexes mentioned above produces the same effect as the deletion of the complex${\mathcal{C}}_{2}$ from a type 1 linkage class as described in the section on effect of model reduction. Deletion of hydroxyacyl and ketoacyl CoAs of even chain lengths between 16 and 8 is equivalent to removal of the linkage classes to which they belong. Deletion of C4 and C6 hydroxyacyl CoA is equivalent to reducing the number of reactions in the linkage class to which they belong, which in turn is equivalent to replacing the enzymes crotonase and M/SCHAD with a single enzyme CRMS.

### Discussion

Our model reduction method involves rewriting of the complex graph corresponding to a given network. In the literature, there are other model reduction methods that involve graph rewriting like QSSA and quasi-equilibrium procedures, the method of[21] and the graph rewriting of monomolecular reaction networks described in[3]. The difference between these methods and ours is that these involve rewriting of the species-reactions graph unlike ours where the complex graph is rewritten.

In order to come up with a reasonably good reduced model, we follow an iterative procedure as described in the subsection titled “Error integral”. This iterative procedure involves computation of error integrals of a number of reduced models which are obtained by deletion of different combinations of complexes. In the beta-oxidation example, where the original model consists of 43 species and the reduced one has 30 species, the required number of simulations is (43-*M*)+(42-*M*)+(41-*M*)+⋯+(31-*M*) where *M* is the number of species that must still be present in the reduced model (and hence, are not considered in the subset of complexes for deletion). In our example, *M*=14 (corresponding to all Acyl-carnitines in the cytosol and mitochondria) and the total simulations using our procedure are 299. More precisely, if there are *N* number of species, *M* number of important species and if *L* is the dimension of the reduced species, then the total number of simulations is$\sum _{i=L}^{N}(i-M)=\left(\frac{L+N}{2}-M\right)(N-L+1)$. Although our procedure is time consuming, it is simple and systematic, ensures that the reduced model closely mimics the transients of the original model and is scalable to a large model. We are currently investigating the computation of error bounds based on the algebraic property of the Laplacian matrices and we foresee that this knowledge might allow us to directly obtain the optimal set of complexes to be deleted.

The cut-off value of the error integral at which we stop our iterative model reduction procedure can be set according to the desired closeness to the original model. For the two models discussed in this paper, this value has been set at 0.1 and it has been found that if this value is set at 0.2, then the resulting comparison plots of the transient behaviours of the original vs the reduced models reveal significant visual differences. Another method of coming up with a cut-off value for the error integral is to look for a sudden, steep increase in the error integral histogram. However in the case where the error-integral histogram shows uniform increase with an increase in the number of complexes deleted, this method cannot be used.

Note that in principle, complexes can be deleted to reduce any biochemical model, whether asymptotically stable or not. However, for the computation of error integral as described in the paper, it is necessary that the original network is asymptotically stable around a steady state, since the computation makes use of the steady state concentrations of some species of the network.

*X*

_{1},

*X*

_{2},…,

*X*

_{10}are distinct species of the network. Consider the following reaction network consisting of three reversible reactions:

Now consider deletion of the complex *X*
_{4}+*X*
_{5} from the above reaction network. This deletion leads to the deletion of the second reaction of the network. Since the first and the third reaction of the network do not have common species, deletion of the second reaction leads to the first and the third reactions occuring independently of each other. This will lead to the reduced model exhibiting a behaviour which is not close to the behaviour of the original model. Although one can quantify the difference between the behaviours using error integrals, avoiding such deletions will reduce the computational effort in making the choice of complexes to be deleted. Examples of such deletions are deletion of complexes TRIO or BPG in the yeast glycolysis model and deletion of complex C16 Acyl Carnitine in the beta oxidation model.

We remark here that one should update a reduced model when major changes are made to the original model. For example, if we consider the rat liver beta-oxidation model of a MCAD-deficient animal, this model will not have the enzyme MCAD. In this case, the dynamic behaviour of the reduced model of Figure7 may be far from that of the original model of Figure5 without the enzyme MCAD.

## Conclusions

In this paper, we have outlined a method for model reduction of biochemical reaction networks that are asymptotically stable around a steady state. The principle behind our model reduction method is to couple the dynamics of certain complexes to the dynamics of the neighbouring complexes in such a way that the net rate of inflow into the complex is equal to the net rate of outflow from it. We provide an algorithm for choosing the complexes to be deleted in such a way that the transient behaviour of the significant species of the reduced model is close to that of the original model. Apart from a reduction in the number of state variables, our model reduction method also leads to a reduction in the number of reactions and parameters of the model. This in turn leads to an improved computational effort required in order to analyze the model. Our model reduction procedure ensures that the reduced model mimics the full model well under the conditions of a specific dynamic event. A different reduced model with a different set of deleted complexes may be produced by our procedure under the conditions of a different dynamic event.

In Additional file1, we give a list of some well-known enzyme kinetic rate laws for which our model reduction method is applicable. Some of the rate laws provided in this list are rate laws for irreversible reactions. However our method is also applicable for the reversible version of these rate laws. This is because a reversible reaction can be split into its forward and reverse reaction components and if our method is applicable to each of these components then it is applicable to the given reversible reaction. For example, since our method is applicable to reactions governed by irreversible mass action kinetics, it is also applicable for reactions governed by reversible mass action kinetics. The list provided in Additional file1 is not an exhaustive list of all enzyme kinetic rate laws for which our method is applicable. We have checked that our method is applicable to all the rate laws that are included in the COPASI software[34].

We have applied our method on a yeast glycolysis model and a beta-oxidation model in rat liver and have observed a good agreement between the transient behaviours of the original and the reduced models. In these cases, our model reduction method has also helped us significantly in improving our understanding of the dynamics of the networks, for example by identification of the close-to-equilibrium reactions of the yeast glycolysis model and of the reaction pathways with comparatively low fluxes in the rat liver beta-oxidation model. In the case of the yeast glycolysis model, we found that the order of deletion of complexes (metabolites) is not the same as the order of their convergence times. This shows that in this case, our model reduction approach will perform differently from a time-scale separation technique where metabolites with faster convergence times are assumed to attain rapid steady state. As observed in the two examples of metabolic reaction networks, our model reduction method helps in removing redundancies in the given network (in the yeast glycolysis network, redundant reactions were coupled and in the rat liver beta-oxidation model, redundant pathways were removed).

Recently, there has been an interest in kinetic modelling of large genome-scale networks. For example,[35] gives a method for building a parameterized genome-scale kinetic model of a network consisting of 956 reactions and 820 metabolites. We envisage that our model reduction method will be particularly useful to reduce the complexity of such large genome-scale kinetic models in the future. Likewise, it can also be useful in reducing multiscale models of biochemical reaction networks which are computationally burdensome to analyze. In a large-scale kinetic model of a biochemical reaction network, our model reduction method can be used to reduce all pathways except the ones of interest into which we would like to zoom-in and analyze.

Currently, we are using our reduced model of the rat liver beta-oxidation model that we explained in an earlier section in order to check for possible bifurcations. In this respect, the reduced model provides an advantage over the full model as it requires lesser computational effort while checking for bifurcation.

## Ethics

The authors declare that no experiments have been performed as part of the research for this manuscript.

## Declarations

### Acknowledgements

We thank Dr. Guy-Bart Stan and Juan Kuntz for their critical comments on an earlier draft of the manuscript. We also thank the reviewers of this manuscript for patiently going through it and providing suggestions to improve its readability. Their comments have helped us in improving the quality of the manuscript. This work was funded by the Netherlands Organization for Scientific Research (NWO) to the Systems Biology Centre for Energy Metabolism and Ageing. AJvdS received funding from the European Union Seventh Framework Programme [FP7/2007-2013] under grant agreement No.257462 HYCON2 Network of Excellence. KvE has been funded by the Netherlands Genomics Initiative via the Netherlands Centre for Systems Biology and by the Top Institute Food and Nutrition. BMB received a Rosalind Franklin Fellowship from the University of Groningen.

## Authors’ Affiliations

## References

- Chickarmane V, Paladugu SR, Bergmann F, Sauro HM:Bifurcation discoverly tools. Bioinformatics. 2005, 21: 3688-3690. 10.1093/bioinformatics/bti603.View ArticlePubMedGoogle Scholar
- Levering J, Kummer U, Becker K, Sahle S:Glycolytic oscillations in a model of a lactic acid bacterium metabolism. Biophys Chem. 2013, 172: 53-60.View ArticlePubMedGoogle Scholar
- Radulescu O, Gorban AN, Zinovyev A, Noel V:Reduction of dynamical biochemical reaction networks in computational biology. Front Genet. 2012, 3: 00131-View ArticleGoogle Scholar
- Radulescu O, Gorban AN, Zinovyev A, Lilienbaum A:Robust simplifications of multiscale biochemical networks. BMC Syst Biol. 2008, 2: 86-10.1186/1752-0509-2-86.PubMed CentralView ArticlePubMedGoogle Scholar
- Roussel MR, Fraser SJ:Invariant manifold methods for metabolic model reduction. Chaos. 2001, 11: 196-206. 10.1063/1.1349891.View ArticlePubMedGoogle Scholar
- Gorban AN, Karlin IV:Method of invariant manifold for chemical kinetics. Chem Eng Sci. 2003, 58: 4751-4768. 10.1016/j.ces.2002.12.001.View ArticleGoogle Scholar
- Sunnåker M, Cedersund G, Jirstrand M:A method for zooming of nonlinear models of biochemical systems. BMC Syst Biol. 2011, 5: 140-10.1186/1752-0509-5-140.PubMed CentralView ArticlePubMedGoogle Scholar
- Nikerel IE, van Winden WA, Verheijen PJT, Heijnen JJ:Model reduction and a priori, kinetic parameter identifiability analysis using metabolome time series for metabolic reaction networks with linlog kinetics. Metab Eng. 2009, 11: 20-30. 10.1016/j.ymben.2008.07.004.View ArticlePubMedGoogle Scholar
- Segel IH:Enzymes. Biochemical Calculations: How to Solve Mathematical Problems in General Biochemistry, 2nd edition. 1968, New York: Wiley, 208-323.Google Scholar
- Segel LA, Slemrod M:The quasi-steady-state assumption: a case study in perturbation. SIAM Rev Soc Ind Appl Math. 1989, 31: 446-477.Google Scholar
- Härdin HM:Handling biological complexity: as simple as possible but not simpler. Ph.D. Thesis. Vrije Universiteit, Amsterdam, 2010,Google Scholar
- Surovtsova I, Sahle S, Pahle J, Kummer U:Approaches to complexity reduction in a systems biology research environment (SYCAMORE). Proceedings of the 2006 Winter Simulation Conference, 3-6 December 2006. Edited by: Perrone LF, Wieland FP, Liu J, Lawson BG, Nicol DM, Fujimoto RM. 2006, Monterey, California, USA: IEEE, 1683-1689.Google Scholar
- Kourdis PD, Palasantza AG, Goussis DA:Algorithmic asymptotic analysis of the NF-
*κ*B signaling system. Comput Math Appl. 2013, 65: 1516-1534. 10.1016/j.camwa.2012.11.004.View ArticleGoogle Scholar - Noel V, Grigoreiv D, Vakulenko S, Radulescu O:Tropical geometries and dynamics of biochemical networks. Application to hybrid cell cycle models. Electron Notes Theor Comput Sci. 2012, 284: 75-91.View ArticleGoogle Scholar
- Liu G, Swihart MT, Neelamegham S:Sensitivity, principle component and flux analysis applied to signal transduction: the case of epidermal growth factor mediated signaling. Bioinformatics. 2005, 21: 1194-1202. 10.1093/bioinformatics/bti118.View ArticlePubMedGoogle Scholar
- Maurya MR, Bornheimer SJ, Venkatasubramanian V, Subramaniam S:Reduced-order modelling of biochemical networks: application to the GTPase-cycle signalling module. IET Syst Biol. 2005, 152: 229-242. 10.1049/ip-syb:20050014.View ArticleGoogle Scholar
- Apri M, de Gee M, Molenaar J:Complexity reduction preserving dynamical behaviour of biochemical networks. J Theor Biol. 2012, 304: 16-26.View ArticlePubMedGoogle Scholar
- Androulakis IP:Kinetic mechanism reduction based on an integer programming approach. AIChE J. 2000, 46: 361-371. 10.1002/aic.690460214.View ArticleGoogle Scholar
- Bhattacharjee B, Schwer DA, Barton PI, Green WH:Optimally reduced kinetic models: reaction elimination in large-scale kinetic mechanisms. Combust Flame. 2003, 135: 191-208. 10.1016/S0010-2180(03)00159-7.View ArticleGoogle Scholar
- Petzold L, Zhu W:Model reduction for chemical kinetics: an optimization approach. AIChE J. 1999, 45: 869-886. 10.1002/aic.690450418.View ArticleGoogle Scholar
- Clarke BL:General method for simplifying chemical networks while preserving overall stoichiometry in reduced mechanisms. J Chem Phys. 1992, 97: 4066-4071. 10.1063/1.463911.View ArticleGoogle Scholar
- Danø S, Madsen MF, Schmidt H, Sedursund G:Reduction of a biochemical model with preservation of its basic dynamics properties. FEBS J. 2006, 273: 4862-4877. 10.1111/j.1742-4658.2006.05485.x.View ArticlePubMedGoogle Scholar
- Schmidt H, Madsen MF, Danø S, Sedursund G:Complexity reduction of biochemical rate expressions. Bioinformatics. 2008, 24: 848-854. 10.1093/bioinformatics/btn035.View ArticlePubMedGoogle Scholar
- Bollobas B: Modern Graph, Theory. Graduate Texts in Mathematics 184. 1998, New York: SpringerGoogle Scholar
- Kron G: Tensor Analysis of Networks. 1939, New York: WileyGoogle Scholar
- van Eunen K, Kiewiet JAL, Westerhoff HV, Bakker BM:Testing biochemistry revisited: how in vivo metabolism can be understood from in vitro enzyme kinetics. PLoS Comput Biol. 2012, 8 (4): e1002483-10.1371/journal.pcbi.1002483.PubMed CentralView ArticlePubMedGoogle Scholar
- van Eunen K, Simons SM, Gerding A, Bleeker A, den Besten G, Touw CM, Houten SM, Groen BK, Krab K, Reijngoud DJ, Bakker BM:Biochemical competition makes fatty-acid
*β*-oxidation vulnerable to substrate overload. PLoS Comput Biol. 2013, 9 (8): e1003186-10.1371/journal.pcbi.1003186.PubMed CentralView ArticlePubMedGoogle Scholar - Horn FJM, Jackson R:General mass action kinetics. Arch Rational Mech Anal. 1972, 47: 81-116.View ArticleGoogle Scholar
- Horn FJM:Necessary and sufficient conditions for complex balancing in chemical kinetics. Arch Rational Mech Anal. 1972, 49: 172-186.View ArticleGoogle Scholar
- Feinberg M:Chemical reaction network structure and the stability of complex isothermal reactors -I. The deficiency zero and deficiency one theorems. Chem Eng Sci. 1987, 43: 2229-2268.View ArticleGoogle Scholar
- Sontag ED:Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction. IEEE Trans Autom Control. 2001, 46: 1028-1047. 10.1109/9.935056.View ArticleGoogle Scholar
- van der Schaft AJ:Characterization and partial synthesis of the behavior of resistive circuits at their terminals. Syst Contr Lett. 2010, 59: 423-428. 10.1016/j.sysconle.2010.05.005.View ArticleGoogle Scholar
- Niezink NMD:Consensus in networked multi-agent systems. Master’s thesis in Applied Mathematics. Faculty of Mathematics and Natural Sciences, University of Groningen; 2011,Google Scholar
- Hoops S, Sahle S, Gauges R, Lee C, Pahle J, Simus N, Singhal M, Xu L, Mendes P, Kummer U:COPASI — a COmplex PAthway SImulator. Bioinformatics. 2006, 22: 3067-3074. 10.1093/bioinformatics/btl485.View ArticlePubMedGoogle Scholar
- Smallbone K, Simeonidis E, Swainston N, Mendes P:Towards a genome-scale kinetic model of cellular metabolism. BMC Syst Biol. 2010, 4: 6-10.1186/1752-0509-4-6.PubMed CentralView ArticlePubMedGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.