- Research article
- Open Access
- Published:

# Estimation of the number of extreme pathways for metabolic networks

*BMC Bioinformatics*
**volume 8**, Article number: 363 (2007)

## Abstract

### Background

The set of extreme pathways (ExPa), {**p**_{
i
}}, defines the convex basis vectors used for the mathematical characterization of the null space of the stoichiometric matrix for biochemical reaction networks. ExPa analysis has been used for a number of studies to determine properties of metabolic networks as well as to obtain insight into their physiological and functional states *in silico*. However, the number of ExPas, *p* = |{**p**_{
i
}}|, grows with the size and complexity of the network being studied, and this poses a computational challenge. For this study, we investigated the relationship between the number of extreme pathways and simple network properties.

### Results

We established an estimating function for the number of ExPas using these easily obtainable network measurements. In particular, it was found that log [*p*] had an exponential relationship with \mathrm{log}\left[{\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}}\right], where *R* = |*R*_{
eff
}| is the number of active reactions in a network, {d}_{{-}_{i}} and {d}_{{+}_{i}} the incoming and outgoing degrees of the reactions *r*_{
i
}∈ *R*_{
eff
}, and *c*_{
i
}the clustering coefficient for each active reaction.

### Conclusion

This relationship typically gave an estimate of the number of extreme pathways to within a factor of 10 of the true number. Such a function providing an estimate for the total number of ExPas for a given system will enable researchers to decide whether ExPas analysis is an appropriate investigative tool.

## Background

Extreme pathways (ExPas) of a metabolic network are the irreducible set of vectors that define the basis of the null-space of the network's stoichiometric matrix. Every allowable solution to the flux balance equations of a reaction network in steady state, **S**·*ν* = **0**, can be represented as a non-negative linear combination of the extreme pathway vectors. ExPas are biochemically and thermodynamically feasible pathways that transform a selection of the given substrates to a selection of allowable products. ExPas have been extensively used for the analyses of metabolic networks (see, for example, [1–5]). Typically, such analyses used ExPas to define possible phenotypic states of metabolic networks under different simulation conditions, to identify network redundancy, and to reveal *eigenpathways* that effectively characterize all relevant physiological states of a metabolic network. Modified versions of ExPa analyses have also been applied to regulatory networks [6, 7] and signaling pathways [8]. Such applications are still in their infancy and are important research topics. However, as the size of a network increases, the redundancy of the network, that is, the number of different pathways that transform given substrate(s) to given product(s) [9, 10], becomes more apparent, and the number of ExPas increases rapidly. Redundancy also exists in small systems but this can be easily handled and even provide insights to legitimate alternative pathways. As the number of ExPas increases at a drastic rate, performing insightful analyses using ExPas become increasingly difficult.

The fact that the set of ExPas of a biochemical reaction network defines the boundaries of its convex steady-state solution space makes them a valuable tool for metabolic network analysis. Further, they emphasize alternative pathways that exist in a network, which may otherwise be overlooked, and that can enrich the understanding of its possible physiological states. However, the increasing details included in reconstructed metabolic networks lead to the combinatorial explosion of the number of ExPas and their computation time. A method providing a good estimate for the final number of ExPas for a given system will enable researchers to decide whether ExPas analysis is a appropriate tool for their objectives.

Another method often used for characterizing the steady-state solution space for a biochemical reaction network is known as Elementary Modes (EMs) [11]. Both ExPa and EM analyses require the resulting solution vectors to be non-decomposable and unique. In addition, ExPa vectors are required to be systemically independent [12]. As a result, ExPas for a system are a minimal set of EMs, and the number of ExPas is less than or equal to the number of EMs. Since both ExPas and EMs are biochemically and thermodynamically feasible pathways, the number of these pathways cannot be estimated using traditional graph theoretical algorithms, such as the Dijkstra's algorithm [13], for finding all shortest paths.

The combinatorial complexity of Elementary Modes of a network was previously described by Klamt *et al*. [14] by providing an upper-bound for the number of EMs. In their work, the authors considered the following combinatoric problem: given a network with *n* reactions and *m* metabolites, the maximal number of independent pathways occurs when each possible subset of the reactions consisting of the *m* metabolites are independent. This maximal number was found to be \left(\begin{array}{c}n\\ m+1\end{array}\right). They further improved the upper-bound by removing those reactions that were not utilized (redundant reactions) in the condition-specific models of the network. Klamt *et al*. generated 5 models of the *E. coli* reconstruction, which yielded 599 to 507632 elementary modes. The upper-bounds for these models ranged from 5.57 × 10^{17} to 4.39 × 10^{21}, which were subsequently reduced to 1.67 × 10^{11} to 4.85 × 10^{13} after removing redundant reactions identified using *FluxAnalyzer*. Despite an improvement of a factor of 6 to 8, when comparing the upper-bounds to the actual number of EMs calculated for the models, they typically overestimated by approximately 6 × 10^{9}% [14]. Although their work dealt with EMs, the problem was constructed as a purely combinatoric problem. Therefore the same reasoning can be directly applied to Extreme Pathways.

In this study, we investigated the relationship between the number of ExPas for a given network, *p* = |{**p**_{
i
}}|, and its basic network measurements. Several network measurements are commonly used in describing the topological features of a network and include connectivity, clustering coefficient, network diameter, and degree distribution [15]. The number of ExPas for a network can vary dramatically under different simulation conditions, that is, different environmental constraints. Consequently, basic network information such as the numbers of reactions and metabolites of the network cannot be solely used to provide a meaningful estimate. Since ExPas are connected reactions, we hypothesized that the higher the reaction connections, the larger the number of ExPas. Based on this hypothesis, we demonstrated an exponential relationship between log [*p*] and \mathrm{log}\left[{\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}}\right], where *R* = |*R*_{
eff
}| is the active (or effective) reactions in the network, {d}_{{-}_{i}} and {d}_{{+}_{i}} are the incoming and outgoing degrees of a reaction, and *c*_{
i
}is the clustering coefficient for each active reaction. This relationship typically gave an estimate of the number of ExPas to within a factor of 10. Since these network measurements can be calculated quickly and easily for any sized network, an estimation of ExPa numbers can be readily obtained as this serves as an assessment of the feasibility of ExPas as an analysis tool.

## Results

The number of extreme pathways (ExPa), *p* = |{**p**_{
i
}}|, for a metabolic network increases drastically with the complexity and size of the network. An estimate for *p* for a given network can help one decide whether ExPa analysis is a feasible tool for one's research objective. In this study, we investigated the relationship between *p* and a number of factors, *θ*_{
i
}, formed by simple network measurements such as the incoming and outgoing degree of reactions, *d*_{∓}(*r*_{
i
}) = {d}_{{\mp}_{i}}, and clustering coefficient of each reaction, *c*(*r*_{
i
}) = *c*_{
i
}. These measurements were chosen as they could be calculated quickly and easily, and their definitions can be found in the sections titled 'Reaction Connectivity *d*_{±}(*r*_{
i
}) = {d}_{{\pm}_{i}}' and 'Reaction Clustering Coefficient *c*_{
i
}= *c*(*r*_{
i
})', respectively. A total of 52 models, generated from 6 reconstructed metabolic networks by altering environmental conditions, were used to determine a relationship between *p* and *θ*_{
i
}. The ExPas and corresponding network measurements for these models were calculated and used to identify possible estimating functions. Analyses on logged data (the logarithmic values of the data) revealed an exponential relationship between log [*p*] and log [*θ*_{
i
}]. A total of 4 estimating functions using two factors were obtained, which were then tested for robustness using an additional 16 models. The numbers of ExPas for most of these models were successfully estimated to within a factor of 10. We concluded that it was possible to formulate an estimating function for the number of ExPas of a model, *p*', that typically falls within a factor of 10 of the actual number of ExPa.

### Identification of Significant Contributing Factors

We aimed to identify factors that can be used for establishing appropriate estimating functions. Desirable factors must be *i)* easily obtained and *ii)* specific for a given model. For example, network measurements such as the incoming and outgoing degrees of each reaction, *d*_{∓}(*r*_{
i
}) = {d}_{{\mp}_{i}}, their clustering coefficients, *c*(*r*_{
i
}) = *c*_{
i
}, as well as the number of external metabolites and their degrees can be obtained quickly. In addition, we required factors to be highly correlated to the number of ExPas and, furthermore, increased in values consistently with *p* to avoid misrepresentation due to incomparable ranges. The network measurements used in this study are detailed in the 'Network Measurements' section.

A number of potential factors for the estimating functions were formed using the aforementioned network measurements (Table 1). The correlations of these potential factors and *p* were evaluated using the Pearson's product-moment correlation, *r*, and Spearman-rank correlation, *ρ*. The Pearson's correlation is generally used as an indicator for the strength and direction of a *linear* relationship and is considered to be robust enough to handle non-parametric data. On the other hand, the Spearman's correlation describes the monotonic relationship between two variables without making any assumptions about the frequency distribution of the variables. We used both of these correlation coefficients on the original and logged data to avoid misinterpretation due to the wide ranges of data (Table 1). For the original data, the factor with the highest Pearson correlation before was found for {\theta}_{1}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}}, where *R* = |*R*_{
eff
}| is the number of active reactions in the network. In contrast, after data-logging, the strongest correlation with *p* was found for {\theta}_{2}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}}. The correlation between these two factors themselves were extremely high (~0.992176). In addition, both factors had the second highest Spearman correlations with *p*. Furthermore, these two factors also had ranges comparable to that of the number of ExPas. Despite the fact that the factors *θ*_{1} and *θ*_{2} are so closely correlated, both of these factors were used to create estimates utilizing single factors in the following section.

### Single Factor Estimate

The factors identified in the previous section, namely {\theta}_{1}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}} and {\theta}_{2}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}} were used to formulate estimating functions for the number of extreme pathways, *p*. Preliminary analyses showed that the relationships between log [*p*] and log [*θ*_{
j
}], *j* = 1, 2, were non-linear (Figure 1 and Figure 2). In particular, the expression found to best describe these relationships had the form

where {\widehat{p}}_{k} is the estimated number of ExPas for a given model *k*, *θ*_{j, k}are the values of the factors *θ*_{
j
}, *j* = 1, 2 for the *k*^{th} model, and *R*_{
k
}is the number of active reactions in model *k*. The estimating functions were formulated using the factors *θ*_{
j
}solely (case *i* = 1) and by scaling these factors with {R}_{k}^{\omega} (case *i* = 2). For the former, the parameter *ω*_{1} had the value 0. For the latter case, *ω*_{2} was the optimal value for which the highest Pearson's correlation between log [*p*] and log [{\widehat{p}}_{k}] could be obtained using the two different factors. This number was found to be the same for both factors and had the value *ω*_{2} = 2.124857. The parameters *α*_{i, j}, *β*_{i, j}, and *γ*_{i, j}take on different values for the four estimating functions *f*_{
i
}(*θ*_{
j
}), which are detailed in the following subsections 'Estimation Using *θ*_{1}' and 'Estimation Using *θ*_{2}'.

#### Estimation Using *θ*_{1}

Using factor {\theta}_{1}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}}, the following estimating function was obtained when *ω*_{1} was applied:

and with *ω*_{2}:

The fitted curves given by Equations (2) and (3) are shown in Figure 1. The Pearson's correlation was 0.883439 for the function given by Equation (2), whereas that given by Equation(3) resulted in a better fit, with correlation being 0.900704 and reduced mean absolute- and root-mean-square errors (Table 2). The overall performance of this estimator was evaluated. It was found that the number of ExPas for most of the models (47 out of 52) could be described to within a factor of 10 using the estimating functions, while those that could not tended to be over-estimated (Table 2). The inclusion of the factor {R}^{{\omega}_{2}} led to better fits between the estimating function and the training data and reduced average errors.

#### Estimation Using *θ*_{2}

Using the second factor, *θ*_{2}, the estimating functions with and without scaling had the respective forms

and

The relationships between log [*p*] and Equations (4) and (5) are displayed in Figure 2. In this case, the Pearson's correlation before the inclusion of *R*^{ω}was 0.887057, and was improved to 0.898332 after scaling.

Similar to the case for *θ*_{1}, the errors were reduced after scaling (Table 2). The unscaled estimating function, Equation (4), again, described most of the models (48 out of 52) to within a a factor of 10 with respect to the actual ExPa numbers (Table 2). The inclusion of the scaling factor resulted in less outliers, a better correlation and reduced errors (Table 2).

### Performance of Estimations Functions

The performance of the estimating functions (2–5) was tested using an additional 16 models. These models were reduced but functional models of the central metabolism derived from reconstructed metabolic networks of 3 different organisms, namely *H. pylori* [3], *M. barkeri* [16], and *H. influenzae* [1]. All four estimating functions successfully predicted 9 out of the 16 test models (56%) to within a factor of 10 (Figure 3). For all four estimating functions, the number of ExPas of seven models were overestimated by a factor greater than 10 while none were under-estimated beyond that factor. In particular, the estimating function *f*_{2}(*θ*_{1}) yielded the smallest error range for all models. The 16 test data points had the highest correlation with *f*_{2}(*θ*_{1}), as did the 52 data points used for its formulation (Table 3). We concluded that the estimating function *f*_{2}(*θ*_{1}) can typically successfully estimate the number of ExPas of a metabolic network to within a factor of 10.

### Consideration of Other Network Measurements

During the development of these estimating functions, other factors such as the degrees of exchange metabolites were considered. In the case of exchange metabolites, the correlation of the sum of the degrees of all input metabolites, {D}_{in}={\displaystyle {\sum}_{i=1}^{\left|{M}^{-}\right|}d({m}_{i}^{-})} was found to have a low correlation (< 0.5) to the number of extreme pathways, both before and after the data was logged. The correlation for output metabolites, {D}_{out}={\displaystyle {\sum}_{i=1}^{\left|{M}^{+}\right|}d({m}_{i}^{+})}, however, was found to have a high correlation (> 0.5) to *p*. Their product, *D*_{
in
}·*D*_{
out
}, had correlations of 0.408543 and 0.638261 before and after the data was logged. A similar situation existed for the number of effective reactions *R*, which had a low and high correlation before and after the data was logged. By inspection, a relationship in the bform of Equation (1) could have been established for *R*. However, the range of *R* did not grow as consistently as *θ*_{1} and *θ*_{2}. As an example, for one *H. pylori* model, 174 effective reactions resulted in 204,412 extreme pathways, whereas for the Mitochondria model with the reaction SUCD3-u10 m removed, 174 effective reactions only produced 4209 ExPas. This then led to the conclusion that *R* alone was not an appropriate factor of estimation. The fact that the factor *θ*_{1} grows consistently with *p* may have over-shadowed the importance of these factors.

## Discussion

The goal for this study was to produce an estimating function using basic network measurements. Specifically, we aimed to obtain a function such that only a single factor is used for estimation. In principle, it was possible to use a multivariate (polynomial) regression method using a number of the factors described in the section 'Identification of Significant Contributing Factors'. However, the independence assumption upon which this method is based was not applicable as the factors themselves tend to be highly correlated. Furthermore, it would have been difficult to interpret which factors were truly responsible for the increase in *p*, and would probably lead to inaccurate estimations in test models. Here, the most descriptive factor was *θ*_{1}, which includes the clustering coefficients. The interpretation of the clustering coefficient used in this study is also often used in sociology and biochemical networks (see, for example, [15, 17]). There are other interpretations of the clustering coefficient, such as that described by Soffer *et al*. [18]. Their definition eliminates degree-correlation biases, thus, quantifying the connectivity amongst the neighbors of a vertex independent to its degree and the degree of its neighbors. It would be interesting to use a similar definition for directed graphs and investigate its effects on ExPa estimation. Additionally, it is possible that other factors may provide a more accurate estimation for the number of ExPas. However, these factors may only be found by detailed analyses of network structures.

The estimating function given by Equation (3) typically estimated the number of ExPas of the test models to within a factor of 10. In cases where it failed, it did not under-estimate the number of ExPas. The version of the *E. coli* reconstructed network used by Klamt *et al*. [14] was not elementally- and charge-balanced and has since been replaced by updated versions [19, 20]. We used a revised version *iJE660a*, which was found to be the closest to what they used, and is publicly available [19, 21], to compare our method with Klamt's. When the estimating function was applied to this version, assuming that all reactions were active concurrently, 7 × 10^{12} ExPas were estimated with our method, whereas Klamt's method yielded an upper-bound of 5 × 10^{13} after disregarding inactive reactions in the unbalanced and smaller model. Given that *iJE660a* has 41 more reactions and all the reactions are elementally- and charge-balanced, we are confident that our estimating function can also serve as a conservative upper-bound of the number of ExPas after some adjustments. For larger networks such as the latest published reconstruction of *E. coli* consisting of 904 cited reactions [20], we estimate 3 × 10^{18} ExPas, The Human reconstructed network with 3311 reactions [22] is predicted to have 10^{29} ExPas when all reactions were active concurrently.

## Conclusion

In this study, we investigated the possibility of estimating with confidence the number of extreme pathways (ExPa), *p*, for metabolic networks. Our effort concentrated on the use of simple network measurements, namely the incoming and outgoing degrees, {d}_{{\mp}_{i}} and the clustering coefficients, *c*_{
i
}, for each of the active reactions, *r*_{
i
}∈ *R*_{
eff
}. In particular, it was found that log [*p*] was correlated to the factors {\theta}_{1}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}{c}_{i}} and {\theta}_{2}={\displaystyle {\sum}_{i=1}^{R}{d}_{{-}_{i}}{d}_{{+}_{i}}} with an exponential relationship. These factors can be calculated quickly and easily, and were found to increase in values consistently with *p*. The resulting estimating functions, in particular that given by Equation (3), typically estimated the number of ExPas to within a factor of 10. Therefore we are confident that these estimating functions are scalable and can be reliably applied to larger networks. These estimating functions will therefore enable researchers to decide whether ExPa analysis is an appropriate investigative tool for their objectives.

The set of extreme pathways is the convex basis used for biochemical characterization of the null-space of the stoichiometric matrix for a biochemical reaction network. ExPa analyses have typically been used to characterize phenotypic states of metabolic networks and identify network redundancy. Beyond these uses, the singular value decomposition of the extreme pathway matrix has been used to identify eigenpathways that are capable of characterizing phenotypic states of a system [23, 24]. Nevertheless, applications such as these require ExPas to be calculated prior to any analysis. The number of ExPas is set to increase dramatically with network size and complexity. In particular, with the increase in details of metabolic network reconstructions and the emergence of reconstruction of global transcription/translation networks, new techniques for calculating and analyzing ExPas are much needed. Since the goal of systems biology is to study an organism as a whole, different types of biochemical networks will eventually be combined so that the system can be studied in its entirety. To over-come future computational challenges as well as being equipped with the necessary analytical techniques should become our immediate goal.

## Methods

### Basic Concepts and Notations

#### Hypergraph

We introduce some basic concepts and notations that will assist us in describing the measurements needed. We first note that a metabolic network can be described as a directed-hypergraph, where a node represents a metabolite and an edge a reaction. The stoichiometric matrix, **S**, can thus be seen as a node-edge incidence matrix. A directed-hypergraph \mathscr{H}(*V*, *E*) consists of nodes (vertices) *v* ∈ *V* and edges *e* ∈ *E*. Let the matrix **S** be the node-edge incident matrix such that *s*_{i, j}< 0 if node *v*_{
i
}is at the tail of edge *e*_{
j
}, *s*_{i, j}> 0 if *v*_{
i
}is at the head of *e*_{
j
}, and *s*_{i, j}= 0 if *e*_{
j
}does not contain *v*_{
i
}. We define the set of nodes *v* that are tails (heads) of edge *r* to be *T*(*e*) (*H*(*e*)). It can easily be seen that *T*(*e*) ∩ *H*(*e*) = ∅.

#### Reaction Adjacency and Neighbourhood Matrices **Â**, \widehat{\Delta}

The adjacency matrix contains information about whether one reaction 'goes into' another. Using the notation introduced in the 'Hypergraph' section, two reactions *r*_{
i
}and *r*_{
j
}are adjacent if *H*(*r*_{
i
}) ∩ *T*(*r*_{
j
}) ≠ ∅ or *H*(*r*_{
j
}) ∩ *T*(*r*_{
i
}) ≠ ∅, that is, the intersection of the set of outputs of reaction *r*_{
i
}and the set of inputs for reaction *r*_{
j
}is non-empty, or vice versa. In particular, we say *r*_{
i
}'goes into' to *r*_{
j
}if *H*(*r*_{
i
}) ∩ *T*(*r*_{
j
}) ≠ ∅. The adjacency matrix **Â** is constructed from the stoichiometric matrix **S** by partitioning **S** into two digitized components **Ŝ**_{+} and **Ŝ**_{-}, where {\widehat{s}}_{{+}_{i,j}}=1 if *s*_{i, j}> 0 and {\widehat{s}}_{{-}_{i,j}}=1 if *s*_{i, j}< 0. Let **S** be an *n* × *m* matrix. The adjacency matrix for the reactions is then given by

The elements of the adjacency matrix {\widehat{a}}_{i,j} = 1 if and only if there exists an metabolite *m*_{
k
}such that *s*_{k, i}> 0 and *s*_{k, j}< 0; *i.e*. reaction *r*_{
i
}'goes into' reaction *r*_{
j
}. In terms of the matrix **Â**, two reactions *r*_{
i
}and *r*_{
j
}are adjacent if either {\widehat{a}}_{i,j} or {\widehat{a}}_{j,i} is non-zero, which is in agreement with the above definition.

Reactions *r*_{
i
}and *r*_{
j
}are said to be *connected* if any of *H*(*r*_{
i
}) ∩ *T*(*r*_{
j
}), *T*(*r*_{
i
}) ∩ *H*(*r*_{
i
}), *H*(*r*_{
i
}) ∩ *H*(*r*_{
j
}) or *T*(*r*_{
i
}) ∩ *T*(*r*_{
j
}) is non-empty. The neighbourhood matrix is given in the form

where {\widehat{s}}_{i,j}=1 if *s*_{i, j}is non-zero and 0 otherwise, and {\widehat{\delta}}_{i,j}=1 iff *r*_{
i
}and *r*_{
j
}are connected.

### Network Measurements

#### Effective Number of Reactions *R*= |*R*_{
eff
}|

For any models of a reconstructed network, redundancy in terms of reactions that are not utilized is often expected. This is due to the fact that, for any specific model, there is a set of reactions that is not used under the specific simulation conditions, and therefore can be removed from the network without affecting the model's function. Extreme pathways are classified into 3 types, with Type-I being those that have exchange fluxes across the system boundaries that correspond to non-currency metabolites [25]. Here, we denote the set of reactions that are present in at least one Type-I ExPas by *R* = |*R*_{
eff
}|. This number can be obtained by optimization techniques such as Flux-Balance Analysis [26] using tools such as SimPheny by Genomatica or FluxAnalyzer [27].

#### Reaction Connectivity *d*_{±}(*r*_{
i
}) = {d}_{{\pm}_{i}}

Having identified the set of reactions from a reconstruction that are active in a model, the stoichiometric matrix **S** can then be reduced by removing inactive reactions and metabolites. The connectivity (degree) of each active reaction can then be calculated. Since **S** can be considered the node-edge incidence matrix for a directed-hypergraph, it is more appropriate to consider the incoming and outgoing metabolites separately. The adjacency and connectivity between each pair of reactions can then be described in terms of the definition given in the section titled 'Reaction Adjacency and Neighbourhood Matrices **Â**, \widehat{\Delta}'. The number of reactions that produce at least one product which is consumed by reaction *r*_{
i
}gives rise to the quantity {d}_{{-}_{i}} = *d*_{
i
}(*r*_{
i
}), and the number of reactions that consume one or more of the products of *r*_{
i
}is defined by the quantity {d}_{{+}_{i}} = *d*_{+}(*r*_{
i
}).

From Figure 4, it can be seen that the number of possible pathways through a given reaction *r*_{
i
}is given by {d}_{{-}_{i}}\cdot {d}_{{+}_{i}}. It is tempting to conclude that the number of pathways calculated is given by {\displaystyle {\prod}_{i=1}^{R}{d}_{{-}_{i}}\cdot {d}_{{+}_{i}}}. However, this would be similar to the number derived in [14], which typically over-estimated the number of elementary modes, of which the set of ExPas {**p**_{
i
}} is a subset, by a factor of 6 × 10^{7}. Here, we instead looked into the relationship between *p* = |{**p**_{
i
}}| and the sum of these terms to avoid such an overestimation.

#### Reaction Clustering Coefficient *c*_{
i
}= *c*(*r*_{
i
})

A metabolic network is described by the stoichiometric matrix **S**. This S-matrix can be seen as a node-edge incidence matrix for a directed hypergraph. However, the clustering coefficient for a hypergraph is not well defined. Since we are interested in how the reactions are connected, we can use the adjacency matrix, **Â**, which contains the node-node (reaction-reaction) information of the network, where {\widehat{a}}_{i,j} ≠ 0 if vertex *v*_{
i
}is adjacent to *v*_{
j
}, *i.e*., reaction *i* goes into reaction *j* (see Figure 5). In this configuration, we can then calculate the clustering coefficients for each active reaction using the usual equation

where *k*_{
i
}is the number of reactions that *r*_{
i
}is connected to, *i.e*., *k*_{
i
}is the number of non-zero elements of the vector {\widehat{\delta}}_{i} of the matrix \widehat{\Delta}. The set {*e*_{p, q}} denotes the set of edges going from *r*_{
p
}to *r*_{
q
}with both *r*_{
p
}and *r*_{
q
}being connected to *r*_{
i
}, *i.e*., *r*_{
p
}and *r*_{
q
}are connected to *r*_{
i
}and are themselves adjacent. The denominator is the number of all such possible edges for a given *r*_{
i
}. Note that since we are dealing with a directed graph, *e*_{p, q}is not the same as *e*_{q, p}. Alternative pathways from one set of substrates to one set of products almost always exist in biological networks, especially in metabolic networks. Figure 6 shows that non-zero clustering coefficients are related to alternative routes, and could then be an important factor for determining the number of extreme pathways calculated.

### Reconstructed Networks and Simulation Conditions

Reconstructed metabolic networks of *H. pylori* [3], Human Cardiac Mitochondria [4], the Human Red Blood Cell [5], and the core *E. coli* [28] network were used in this study. These networks are all mass- and charge-balanced, and were all tested on SimPheny (Genomatica) for the ability to produce biomass constituents. Furthermore, older versions of published, available networks that were used for extreme pathway and flux-balance analysis, which may not be completely balanced, were included in this study. This selection of networks represented a spectrum of complexity. Elementary network measurements, the number of generated models, and the source of each of these networks are detailed in Table 4.

A total of 52 models were used from these networks. Most of these models were used to test for production of products given a specified substrate along with core exchange metabolites. The remaining 9 models included single-reaction deletions and/or the request for specific demand metabolites given a combination of primary substrates. The specific environmental conditions of these models are listed in Table 5, along with the names of abbreviated metabolites in Table 6.

A total of 16 functional models from 3 different organisms were used to test the validity of estimations formulated in the section 'Single Factor Estimate'. The networks used were 2 reduced versions of *H. pylori*, one consisting of 168 reactions and 170 metabolites, the other with 48 reactions and 65 metabolites. Reduced versions of the networks of *M. barkeri* [16] and *H. influenzae* [1] were also used. These consisted of 84 and 61 reactions and 121 and 83 metabolites, respectively. These networks are similar to the core *E. coli* model, with each reaction being mass- and charge-balanced. They were also tested for the production of biomass using SimPheny and hence are functional systems.

The number of data points may seem unorthodox. Although in theory it was possible to automatically generate networks of different input/output combinations, leading to a larger number of training and validation data points, in practice, only a few of such combinations would have resulted in models that produce non-Type-III extreme pathways as well as biomass constituents. For the validation stage, models producing biomass constituents as well as non-Type-III pathways that could be calculated quickly were desired. By drastically reducing networks, it was difficult to construct models that maintained biomass production.

In the case of *H. pylori*, three models were produced using the larger network in its entirety. Since the computation of ExPas is a time-consuming process, a smaller network was created to facilitate this process. This smaller network was subjected to random reaction-deletion while ensuring that the subsequent modified models could still produce equal amount of biomass. Five such models with random deletion were produced for this study. In addition, 5 models for *M. bakeri* and 3 for *H. influenzae* were generated in a similar fashion so that ExPa computation could be done within a reasonable computational time and effort. These are listed in Table 7.

### Calculation of Extreme Pathways and Network Measurements

The extreme pathways of all models were computed using an implementation of the algorithm given in [29]. This implementation includes the C++ STL and the number theory library NTL. Algorithms for calculating the greatest common factor of a set of integers of arbitrary size and for sparse-matrix operations were also implemented. Network properties, including incoming and outgoing degrees and clustering coefficients of reactions, were calculated using a C++ implementation of the methods described in 'Basic Concepts and Notations' and 'Network Measurements' using sparse-matrix algorithms and bitwise operations.

### Correlation Coeffcients

Both Pearson's product-moment and Spearman's rank correlation coefficients were used as a guide to help identify important factors that contribute to the number of extreme pathways. The former is defined as

for a series of *n* measurements *x*_{
i
}and *y*_{
i
}. It was used in this study as a guide to detect linear relationships amongst the data and estimating functions. The non-parametric correlation coefficient used in this study is defined as

where *D*_{
i
}is the difference in the ranks of the corresponding values of the *n* pairs (*x*_{
i
}, *y*_{
i
}). This was used to decide whether a factor increased monotonically with the number of ExPas *p*.

## References

- 1.
Schilling CH, Palsson BØ: Assessment of the Metabolic Capabilities of Haemophilus influenzae Rd through a Genome-scale Pathway Analysis. Journal of Theoretical Biology 2000, 203: 249–283. 10.1006/jtbi.2000.1088

- 2.
Stucki JW: Chromokinetics of Metabolic Pathways. European Journal of Biochemistry 2004, 271: 2745–2754. 10.1111/j.1432-1033.2004.04203.x

- 3.
Thiele I, Vo TD, Price ND, Palsson BØ: Expanded Metabolic Reconstruction of Helicobacter pylori (iIT341 GSM/GPR): an In Silico Genome-Scale Characterization of Single- and Double-Deletion Mutants. Journal of Bacteriology 2005, 187(16):5818–5830. 10.1128/JB.187.16.5818-5830.2005

- 4.
Vo TD, Greenberg HJ, Palsson BØ: Reconstruction and Functional Characterization of the human Mitochondria Metabolic Network Based on Proteomic and Biochemical Data. Journal of Biological Chemistry 2004, 279(38):39532–39540. 10.1074/jbc.M403782200

- 5.
Wiback SJ, Palsson BØ: Extreme pathway Analysis of Human Red Blood Cell Metabolism. Biophysical Journal 2002, 83: 808–818.

- 6.
Gianchandani EP, Papin JA, Price ND, Joyce AR, Palsson BØ: Matrix Formalism to Describe Functional States of Transcriptional Regulatory Systems. PLoS Compuational Biology 2006, 2(8):e101. 10.1371/journal.pcbi.0020101

- 7.
Xiong MM, Xiong JZ, Xiong H: Network-based RegulatoryPathway Analysis. Bioinformatics 2004, 20(13):2056–2066. 10.1093/bioinformatics/bth201

- 8.
Papin JA, Palsson BØ: The JAK-STAT Signaling Network in the Human B-Cell: An Extreme Signaling Pathway Analysis. Biophysical Journal 2004, 87: 37–46. 10.1529/biophysj.103.029884

- 9.
Papin JA, Price ND, Edwards JS, Palsson BØ: The Genome-Scale Metabolic Extreme Pathway Structure in Haemophilus influenzae Shows Significant Network Redundancy. Journal of Theoretical Biology 2002, 215: 67–82. 10.1006/jtbi.2001.2499

- 10.
Price ND, Papin JA, Palsson BØ: Determination of Redundancy and Systems Properties of the Metabolic Network of Helicobacter pylori Using Genome-Scale Extreme Pathway Analysis. Genome Research 2002, 12: 760–769. 10.1101/gr.218002. Article published online before print in April 2002

- 11.
Schuster S, Fell DA, Dandekar T: A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks. Nature Biotechnology 2000, 18: 326–332. 10.1038/73786

- 12.
Papin JA, Price ND, Wiback SJ, Fell DA, Palsson BØ: Metabolic Pathways in the Post-Genome Era. Trends in Biochemical Sciences 2003, 28(5):250–258. 10.1016/S0968-0004(03)00064-1

- 13.
Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms. second edition. MIT Press and McGraw-Hill; 2001.

- 14.
Klamt S, Stelling J: Combinatorial Complexity of Pathway Analysis in Metabolic Networks. Molecular Biology Reports 2002, 29: 233–236. 10.1023/A:1020390132244

- 15.
Barabási AL, Oltvai ZN: Network Biology: Understanding the Cell's Functional Organization. Nature Review 2004, 5: 101–113. 10.1038/nrg1272

- 16.
Feist AM, Scholten JCV, Palsson BØ, Brockman FJ, Ideker T: Modeling Methanogenesis with a Genome-Scale Metabolic Reconstruction of Methanosarcina barkeri. Molecular Systems Biology 2006., 2:

- 17.
Heyman K: Making Connections. Science 2006, 313: 604–606. 10.1126/science.313.5787.604

- 18.
Soffer SN, Vázquez A: Network Clustering Coefficient without Degree-Correlation Biases. Physical Review 2005, 71: 057101 -057104.

- 19.
Edwards JS, Palsson BØ: The Escherichia coli MG1655 in silico metabolic genotype: its definition, characteristics, and capabilities. Proc Natl Acad Sci USA 2000, 97: 5528–5533. 10.1073/pnas.97.10.5528

- 20.
Reed JL, Vo TD, Schilling CH, Palsson BØ: An expanded genome-scale model of Escherichia coli K-12 (iJR904 GSM/GPR). Genome Biology 2003, 4(9):R54.1-R54.12. 10.1186/gb-2003-4-9-r54

- 21.
Reaction list of E. coli iJR904[http://systemsbiology.ucsd.edu/organisms/ecoli/ecoli_reactions.html]

- 22.
Duarte NC, Becker SA, Jamshidi N, I T, Mo ML, Vo TD, Srivas R, Palsson BØ: Global reconstruction of the human metabolic network based on genomic and bibliomic data. PNAS 2007, 104: 1777–1782. 10.1073/pnas.0610772104

- 23.
Price ND, Reed JL, Papin JA, Palsson BØ: Analysis of Metabolic Capabilities using Singular Value Decomposition of Extreme Pathway Matrices. Biophysical Journal 2003, 84: 794–804.

- 24.
Price ND, Reed JL, Papin JA, Wiback SJ, Palsson BØ: Network-based Analysis of Metabolic Regulation in the Human Red Blood Cell. Journal of Theoretical Biology 2003, 225: 185–194. 10.1016/S0022-5193(03)00237-6

- 25.
Price ND, Famili I, Beard DA, Palsson BØ: Extreme Pathways and Kirchoff's Second Law. Biophysical Journal 2002, 83: 2879–2882.

- 26.
Schilling CH, Edwards JS, Palsson BØ: Towards Metabolic Phenomics: Analysis of Genomic Data Using Flux Balances. Biotechnology Progress 1999, 15(3):288–295. 10.1021/bp9900357

- 27.
Klamt S, Stelling J, Ginkel M, Gilles ED: FluxAnalyzer: exploring structure, pathways and flux distribution in metabolic networks on interactive flux maps. Bioinformatics 2003, 19(2):261–269. 10.1093/bioinformatics/19.2.261

- 28.
Palsson BØ: Systems Biology: Properties of Reconstructed Networks. Cambridge University Press; 2006.

- 29.
Schilling CH, Letscher DL, Palsson BØ: Theory for the Systemic Definition of Metabolic Pathways and their use in Interpreting Metabolic Function from a Pathway-Oriented Perspective. Journal of Theoretical Biology 2000, 203: 229–248. 10.1006/jtbi.2000.1073

- 30.
Bell SL, Palsson BØ: ExPA: A Program for Calculating Extreme Pathways in Biochemical Reaction Networks. Journal of Bacteriology 2004, 187(16):5818–5830.

- 31.
Schilling CH, Edwards JS, Letscher DL, Palsson BØ: Combining Pathway Analysis with Flux Balance Analysis for the Comprehensive Study of Metabolic Systems. Biotechnology and Bioengineering 2001, 71(4):286–306. Publisher Full Text 10.1002/1097-0290(2000)71:4<286::AID-BIT1018>3.0.CO;2-R

## Acknowledgements

This work was funded by National Institute of General Medical Sciences (NIGMS, grant number GM68837). BØP serves on the Scientific Advisory Board of Genomatica Inc. The authors would like to thank Marc Abrams for critical reading of this manuscript.

## Author information

### Affiliations

### Corresponding author

## Additional information

### Authors' contributions

MY and BØP designed the study. MY performed and developed the programs used for the calculation of extreme pathways and network measurements, and analyzed and interpreted the data. IT provided all data of reconstructed models used in this study. MY drafted the manuscript while IT and BØP provided critical edits and important intellectual content. MY, IT & BØP have read and approved the final version of this manuscript.

## Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

## Rights and permissions

**Open Access**
This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License (
https://creativecommons.org/licenses/by/2.0
), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Yeung, M., Thiele, I. & Palsson, B.Ø. Estimation of the number of extreme pathways for metabolic networks.
*BMC Bioinformatics* **8, **363 (2007). https://doi.org/10.1186/1471-2105-8-363

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1471-2105-8-363

### Keywords

- Estimate Function
- Metabolic Network
- Adjacency Matrix
- Cluster Coefficient
- Network Measurement