 Research article
 Open access
 Published:
Hierarchical modularity of nested bowties in metabolic networks
BMC Bioinformatics volumeÂ 7, ArticleÂ number:Â 386 (2006)
Abstract
Background
The exploration of the structural topology and the organizing principles of genomebased largescale metabolic networks is essential for studying possible relations between structure and functionality of metabolic networks. Topological analysis of graph models has often been applied to study the structural characteristics of complex metabolic networks.
Results
In this work, metabolic networks of 75 organisms were investigated from a topological point of view. Network decomposition of three microbes (Escherichia coli, Aeropyrum pernix and Saccharomyces cerevisiae) shows that almost all of the subnetworks exhibit a highly modularized bowtie topological pattern similar to that of the global metabolic networks. Moreover, these small bowties are hierarchically nested into larger ones and collectively integrated into a large metabolic network, and important features of this modularity are not observed in the random shuffled network. In addition, such a bowtie pattern appears to be present in certain chemically isolated functional modules and spatially separated modules including carbohydrate metabolism, cytosol and mitochondrion respectively.
Conclusion
The highly modularized bowtie pattern is present at different levels and scales, and in different chemical and spatial modules of metabolic networks, which is likely the result of the evolutionary process rather than a random accident. Identification and analysis of such a pattern is helpful for understanding the design principles and facilitate the modelling of metabolic networks.
Background
Cellular metabolism is an essential process for the maintenance of life and metabolic networks have been extensively studied [1â€“7]. Although a large variety of metabolic reactions can be found in different organisms, metabolic networks are highly conserved across them. It remains a highly interesting and challenging problem to understand the architectural characteristics and "design" principles of the metabolic networks in relation to their function. An important finding is that metabolic networks, as well as other realworld complex networks, have topologies that differ markedly to those found in simple randomly connected networks [8], which suggests that their nonrandom structures could imply significant organizing principles of metabolic networks.
Cellular functions are carried out in a modular way [9], while it has been suggested that biological modules correlates with locally dense links in molecular networks [10]. Efforts have been directed towards the recognition of modules in metabolic networks using mathematical methods, especially graph theory. Graphtheoretic methods analyze networks from topological point of view using minimal prior knowledge about biological function, thus have the potential to give new insight into metabolism based on the unbiased structural modules. Newman and Girvan regarded a network has modularity (or community) structure if its nodes could be properly divided into groups within which the nodes are highly connected, but between which they are much less connected [11]. Several algorithms have been developed to break up a metabolic network into modules [12â€“16], while the corresponding modularity metric could be used as a quantitative criterion to evaluate the decomposing quality of a network [11]. Guimera et al. further proposed that the modularity of networks must always be compared to the null case of a random graph. They regarded a network has statistically significant modularity if its modularity metric, i.e., the largest modularity metric of all possible partitions of the network, is statistically bigger than that of the randomised counterparts [17]. They also developed a simulated annealing algorithm to compute the largest modularity metric of a network [14, 18]. On the other hand, it has been discovered, that the global metabolic network is organized in the form of a bowtie [19]. On the basis of such a bowtie topology, Ma and Zeng have proposed a decomposing algorithm based on the shortest path combined with "majority rule" [16]. These methodologies are useful for the analysis of the design principle of metabolic network.
In this work, 75 metabolic networks were constructed from organisms including 8 eukaryote, 56 bacteria and 11 archaea. By applying the decomposing method similar to [16], the topological features of various graph models were studied at different levels, subcellular localizations, and biochemical pathways in the form of bowtie. To mine the inherent topology of metabolic networks, the features from E.coli network were then compared with those of the properly randomized counterparts that preserve the linkage degree of each node and the total number of directed and bidirected arcs [20, 21].
Results/discussion
Decomposing the metabolic networks
The metabolic networks of three microbes (Escherichia coli, Aeropyrum pernix and Saccharomyces cerevisiae iND750) were decomposed. Only the results of the E.coli network are presented in this paper for illustration. The other two networks displays similar features as the E.coli network and the relevant analysis results are provided in Additional file 1 (part II and III).
The metabolic network of E. coli K12 MG1655 consists of 934 nodes and 1437 arcs. The largest connected part of this network embraces 575 nodes and its topology exhibits a bowtie architecture consisting of four parts: giant strong component (GSC), substrate subset (S), product subset (P) and isolated subset (IS). To further decrease the complexity, the GSC part is reduced to a Core through the method of [19]. See part I of Additional file 1 for a visualization of the bowtie structure for E.coli network.
The hierarchical clustering tree for the Core of the GSC, obtained by our decomposition algorithm, is shown in Figure 1. According to the modularity metric from Newman and Girvan [11], 12 clusters of the Core appeared as shown in Figure 2, in which the nodes belonging to the same cluster have the highest degree of structural equivalent, i.e., the clusters are still strongly connected (cluster 2,3,5,6,7,8 and 12), or most of the nodes are strongly connected (cluster 1,4,9,10 and 11). Figure 3 illustrates the decomposition of the whole metabolic network.
Matching modules to particular metabolic functions may reveal the biological significance of this modularity [16, 18]. Following GuimerÃ and Amaral [18], we mapped the modules to KEGG pathway [22, 23]. A cartographic representation [18] of the metabolic network is shown in Figure 4, in which each node corresponds to a cluster. The colours in Figure 4 represent different categories of metabolism while the coloured areas indicate the percentage of respective metabolism within the module.
Figure 4 illustrates that some modules generated by our algorithm are dominated by one major category of metabolisms. For instance, the reactions in the 3^{rd} module are mainly carbohydrate metabolisms that include the majority of metabolites from TCA cycle with glyoxylate bypass, as shown in Figure 5. However, the majority are mixtures of pieces of several conventional biochemical pathways. Extreme examples are module 1 and module 5. When examining the nodes in them we found that there are heavily overlapping compounds both by carbohydrate and amino acid metabolism. It is difficult to assign these metabolites to a single module because they are playing dual and even multiple roles in several metabolism processes. For example, pyruvate in the 1^{st} module is a key metabolite that connects the metabolism of carbohydrates, amino acids and the energy metabolism. See Figure S5 in Additional file 1 for different pathways grouped in module 5. On the other hand, a standard textbook pathway can break into several modules, which is especially true for the three central pathways â€“ EmbdenMeyerhofParnas (EMP), tricarboxylic acid (TCA) and pentose phosphate pathway (PPP). One possible explanation is that the metabolites in these central pathways are used as common precursors for biosynthesis of universal building blocks [24] and are thus placed in different modules. Figure 6 shows how the 12 common precursors scatter in different modules. This finding agrees with earlier observations concerning the high diversity of the TCA and EMP pathway [25, 26], as well as the clustering results for E.coli metabolic network obtained by other algorithms [13, 16, 27].
It can be seen that the modules generated from topology do not completely overlap with traditional biological pathways. However, this purely graphtheoretic clustering without any use of biologyspecific details may provide new insight into metabolism and useful hints to the functional significance of those unknown reactions. Taking module 3 as an example, parts of amino acid metabolites and nucleotide biosynthesis metabolites are connected closely around TCA cycle in module 3, which provides convenient plugs interrelating with other modules. For instance, acting as an important interface to other modules, aspartate (ASPL) provides amino bases for the synthesis of other categories of amino acid in module 4 and module 5, and is also used for pyrimidine synthesis in module 5; while 2oxoglutarate (AKG), as the precursor of glutamate family, is clustered into module 9 as the plug between module 3 and module 9. Hopefully, more research will clarify the biological significance of the underlying difference between topological modules and traditional pathways.
Hierarchical modularity of metabolic networks in the case of nested bowtie
To further investigate the macroscopic structure of each subnetwork, the node distributions in the bowtie structure of the subnetworks were listed in Table 1. It can be seen that almost all of the twelve subnetworks have formed bowtie structures, similar to the global network. We show the four parts of each subbowtie with distinct colours in Figure 3, while in Figure 7 we illustrate the corresponding subtree of module 3 and its bowtie structure. The only exception is the 6^{th} module, which doesn't have the P part, but closely related with module 5 and module 7. This could be caused by our decomposing algorithm that starts from decomposing the core of GSC, which contains highly abundant reversible reactions.
As pointed out in the method part, with the dissimilarity index defined in our algorithm, nodes that belong to the same subtree are not necessarily connected to each other, so are modules that correspond to the neighboured subtrees. For example, although the subtree of module 8 is near that of module 7 in the hierarchical clustering tree shown in Figure 1, module 8 is not connected with module 7 but with module 4, 5 and 12, whose subtrees are far away, as Figure 4 shows. Thus the hierarchical tree cannot reflect the actual linkage relation between modules. To mine how the small modules are organized into bigger ones, we drew a coarsegrained graph to illustrate the connections between the GSC parts of the subnetworks as Figure 8 shows. Each node in Figure 8 corresponds to a cluster, while two nodes in Figure 8 are defined as being connected if and only if the constituent nodes in corresponding GSC parts are linked. Such connecting topology is different from that in Figure 4, in which the arcs correspond to the links between the subnetworks.
It is thus noted from the definition of strongly connected graphs that, if some nodes in Figure 8 can be combined into a strongly connected subgraph, the merger of the corresponding subnetworks may form a bigger bowtie whose GSC is the union of the individual GSC parts [28]. For example, the unions of clusters, such as {1,2,3}, {1,3,4}, {5,8,10,11,12}, and the union of all the twelve clusters have bowtie structures, but the following clusters {1,2}, {4,9,10}, {10,11,12} can't form strongly connected subgraphs, thus are not bowtie. In this way, different subnetworks of bowtie structures can be combined to form bigger bowties at higher level. In other words, Figure 8 delineates the "roadmap" how little bowties are nested into larger bowties through their GSC parts.
The combination of different bowties was also compared with the global bowtie from proportional scale. One hundred and fifty bowties were hierarchically generated by random combinations of a number of basic bowties from the coarsegrained graph in Figure 8. Their node distributions of the four parts (GSC, S, P, and IS) were listed in Table S3 of Additional file 1. The percentage discrepancies of the four parts to those of the global one were also summarized in Table S3. Interestingly, the node distribution of the nested bowties is approximately consistent with that of the global network with an average absolute error of 0.0854, which means each smaller bowtie can be considered as a miniature of the global one.
In this sense, metabolic networks seem to be designed in such a way that many similar small modularized bowtie units, which are hierarchically nested and reoccur at different scales and levels, are coupled levelbylevel into a larger network.
Comparison between the E.coli network and an ensemble of randomly connected networks
Comparing metabolic network with randomized counterparts could reveal intrinsic difference between them [17, 20, 21]. Sixty random networks were constructed by reshuffling the links of the E.coli metabolic network [20, 21]. The graph metrics of the 60 random networks are listed in Table S4 of Additional file 1 and the comparison with the E.coli network is summarized in Table 2. Topological analysis revealed that the macroscopic structures of the random networks still preserve a global bowtie, but substantial difference exists between the E.coli metabolic network and randomized ones in term of the sizes of bowtie parts, average clustering coefficient and modularity metric. It can be seen that the clustering coefficients of the random networks are almost equal to zero, in big contrast to that of the E.coli network. This clear difference implies an overall loose connection of randomized networks but a cliquish topology of the E.coli metabolic network [29]. Such different topological patterns are observably presented in their Cores, as Figure 9 shows. The Core of E.coli network exhibits distinct cohesive areas being sparsely linked together, while the randomized one is linked in such an approximately equal density that almost no clearcut "cliques" appear within it.
Table 2 also shows that the modularity metric of the E.coli network is some 22 standard deviations above that of the randomized network. Thus the higher modularity of E.coli network is unlikely to arise at random. According to the scheme of Maslov et al. and Guimera et al. [17, 21], metabolic network exhibits significantly higher modularity compared with those randomized counterparts statistically. On the other hand, since a network with modularity metric higher than 0.7 could be thought as modular network [11], both E.coli network and its randomized version, whose values of modularity are 0.85 and 0.76 respectively, could be judged as being modular according to the module definition proposed by Newman and Girvan, i.e., the network can be broken up in such a way that it has as many as withinmodule links and as few as possible betweenmodule links. However, modules defined like this and detected by simulated annealing are not compatible with the bowtie like modules (see Figure S16 in Additional file 1). While decomposing this random network in the same way as the E.coli network by our algorithm, we found that, no matter how the hierarchical clustering tree was cut at different level, several unconnected subnetworks consisted of many isolated nodes would be generated. Figure 9(B) shows one manner of the partitions that generates 12 clusters, in which the nodes belonging to the same cluster are not linked together, and the modularity metric corresponding to this decomposition is computed as only 0.0612. In contrast, each cluster of the Core for E.coli network is connected (Figure 9(A)), which could lead to bowtie pattern decomposition. The corresponding modularity metric of Figure 9A is 0.7062. That is to say, structural equivalent nodes tend to connect with each other in the real metabolic network, but split away in random networks. This phenomenon could be the result of local interactions within metabolic pathways.
In summery, in the sense of modules defined by Newman and Girvan, both E.coli network and random ones are modular organized. However, E.coli network has significantly higher modularity, and also could be decomposed as bowtie modules, while the random network does not exhibit modular organization in terms of bowtie modules. These comparative results indicate that the highly modularized bowtie unit is an intrinsic and significant feature of metabolic networks, rather than a random phenomenon.
In addition, we have also seen that the use of degreepreserving rewiring here provides some views into the statistical and graphtheoretic differences between real metabolic networks and random ones. We believe that additional work is required to understand what the other distinctions are, and what the biological significance is of these differences.
Bowtie units from a chemical and spatial viewpoint
Assuming that the highly modularized bowtie unit is common to metabolic networks, the bowtie may be observed from various systems such as cellular organelles and metabolic pathways of fundamental biomolecules. Reactions of the three basic metabolisms, carbohydrate metabolism, lipid metabolism, and amino acid metabolism, were retrieved from the database of [30] for 75 organisms (Eukaryote: 8; Bacteria: 56; Archaea: 11). Our analysis shows that all the reactions in carbohydrate metabolism have framed a bowtie structure for all the examined organisms, as being provided by part VII of Additional file 1. But neither the lipid reactions nor the amino acid reactions can build a bowtie. One possible explanation to this could be the different roles they play. Carbohydrate metabolism plays a fundamental role in nutrients and energy metabolism, which produces lots of flexible intermediated metabolites for the biosynthesis of lipids, amino acid and other materials.
Similar analysis was done to the reactions of the Saccharomyces cerevisiae iND750 [31] according to subcellular localisations. Three cellular compartments, cytosol, mitochondrion, and peroxisome, were studied which include relatively more metabolites. It was found that the subnetworks of cytosol reactions and mitochondrion reactions could exhibit the bowtie patterns as shown in Table 3. It is known that mitochondrion is functionally relatively independent organelle, while the majority of metabolic reactions take place in cytosol. That the peroxisome reactions do not form a bowtie could be caused by the scarcity of reaction information of peroxisome. However, with the development of genomics, proteomics and metabonomics, and the accumulation of subcellular information of more reactions, we speculate that it is possible to find bowtie structures in more organelles.
In brief, bowtie pattern is also present in elementary metabolism such as carbohydrates, and in cellular compartments of mitochondria and cytosol. These results seem to indicate that the modularity of bowtie patterns is common to metabolic networks. At the same time, the complete bowtie patterns in mitochondria and carbohydrates pathways could also imply some independent functional clues.
Significance of modularity in the form of bowtie structure
In the long evolutionary process of metabolism networks and their components, the structure of modularity could contribute significantly to the function of metabolic networks. Here, the recurrence of bowtie structures suggests that bowtie modules may act as another kind of building block of the genomebased metabolic network during the evolutionary process, indicating that evolution might copy and reuse existing modules to give rise to ever higher forms of complexity when new function calls for it.
Another contribution would be network robustness. It is argued that the GSC part in the bowtie of the metabolic network is robust against mutations because there are multiple routes between any pair of nodes within the GSC [19, 32]. While a modular metabolic network which is nested by many relatively independent and robust bowtie units, will provide more advantages in generating coordinated response to various stimuli from environment and further increase the robustness of the whole metabolic system.
Moreover, selection of bowtie as a structural building unit seems to be a concise and smart option for constructing metabolic networks. From the standard biochemical point of view, the metabolic system is organized as a bowtie whose knot is made up of a small handful of activated carriers and 12 precursors, with a large "fanin" of nutrients, and a large "fanout" of products in biosynthetic pathways[24, 33]. Such organization pattern has been reported to be present in various biological systems, such as in signal transduction systems, transcription and translation processes, and immune systems [24, 32â€“36]. The bowtie model here could give alternative view of the biological metabolites flow from the topological aspects, where the knot is much thicker than that of above. We will refer to thin bowtie and thick bowtie to distinguish these two models. These two bowtie models are similar in that they both specially identify and isolate the carriers. It is noted that, besides the carriers, the thin bowtie model includes only the 12 precursors as its knot, whereas the thick bowtie model here also contains these 12 precursors, but together with the three essential pathways â€“ TCA (tricarboxylic acid) cycle, pentose phosphate pathways and glycolysis pathways, which generate the precursors, as well as much more metabolites and reactions. Although different bowtie models in details, the similar organization pattern can both facilitate the kind of extreme heterogeneity that allows for robust regulation, manageable genome sizes and biochemically plausible enzymes [24].
The knot in our model denotes the most tightly connected part of the network and is comprised of concentrated intermediated metabolites. This thicker knot would possibly allow the network to manipulate flexible controls through the knot and provide more interfaces with inputs and outputs to meet an emergency or process new metabolites. On the other hand, the thicker knot may reveal the flexibility that the organism has in interchanging nutrients and products. E. coli in particular heavily uses products of other organism metabolism as nutrients, as do most organisms, but can also live on fairly minimal media as well. The thick knot may reflect this flexibility, but further research will be needed to full explain these connections.
Conclusion
In this survey we have attempted to reveal the topological features of graph models from the view of the design principle of metabolic networks. Our results suggest that metabolic networks exhibit hierarchical modularity in the form of modularized bowtie units, whereas this highly structured modularity is not present in random graphs with comparable statistical weight. This finding is consistent with the conclusions from a number of studies that these structures result from universal and fundamental organizing principles for efficiency and robustness, rather than frozen accidents of evolution. On the other hand, such nested bowtie topology may also be the result of natural selection of biological evolution, which could be conceived as a process where the same patterns and processes repeat at each stage, and are nested at multilevel. The perspectives of this paper would provide useful hints for understanding the function and evolution of metabolic networks, as well as the modeling and simulation of complex biological systems.
Methods
Data preparation and network reconstruction
In this study, the metabolic data were extracted from the database developed by Ma and Zeng based on the Kyoto Encyclopedia of Genes and Genomes (KEGG) [30]. In this database, the information concerning the reversible reactions was specified. In addition, some small molecules, such as adenosine triphosphate (ATP), adenosine diphosphate (ADP), nicotinamide adenine dinucleotide (NAD) and H_{2}O, are normally used as carriers for transferring electrons or certain functional groups and participate in many reactions, while typically not participating in product formation. Therefore, in order to reflect biologically relevant transformations of substrates, these kinds of small molecules, as well as their connections were manually excluded from the database when no products were formed from them. It should be noted that this method of exclusion is not determined by compounds, but by the reaction. For example, glutamate (GLU) and 2oxoglutarate (AKG) are currency metabolites for transferring amino groups in many reactions, but in the following reaction:
AKG + NH_{3} + NADPH = GLU + NADP^{+} + H_{2}O,
AKG participates in producing GLU, i.e., they are primary metabolites. Hence the connections through them should be considered. A metabolic network reconstructed from this database is represented by a directed graph whose nodes correspond to metabolites and whose arcs correspond to reactions between these metabolites, in which irreversible reactions are presented as directed arcs while reversible ones as bidirected arcs. For example, the irreversible reaction,
LGlutamine + 2Oxoglutarate â†’ LGlutamate,
corresponds to two directed arcs, i.e., LGlutamine â†’ LGlutamate and 2Oxoglutarate â†’ LGlutamate.
The metabolic network iND750, a fully compartmentalized genomescale metabolic model of Saccharomyces cerevisiae constructed by Duarte et al. [31], was then studied. This set of data is the most complete metabolic data in the public domain that includes information on subcellular localization. Compartmentalization of information, which includes the localization to the cytosol, Golgi apparatus, mitochondrion, nucleus, endoplasmic reticulum, vacuole, peroxisome, or extracellular space, is given for each reaction. Reactions were assigned to the cytosol by default unless there was evidence that a metabolite was found in a particular compartment.
Referring all the reactions in iND750 to the database of [30], we manually removed the connections through currency metabolites, such as H_{2}O, ATP, NADH, thus the reconstructed network of S. cerevisiae is represented as a directed graph.
Topological features and metrics of networks
Bowtie structure
A network with bowtie structure consists of four parts: giant strong component (GSC), substrate subset (S), product subset (P) and isolated subset (IS) [19]. The GSC is the biggest of all strongly connected components and is much larger than all the other ones, while a strongly connected component is defined as the largest cluster of nodes within which any pair of nodes is mutually reachable from each other. S consists of nodes that can reach the GSC but cannot be reached from it, while P consists of nodes that are accessible from the GSC, but do not link back to it.
The IS contains nodes that cannot reach the GSC, and cannot be reached from it. The GSC part may include many linear branches, which consist of several reversible reactions. Removing these linear branches will lead to the Core of the GSC, which is still strongly connected [19]. See part I of Additional file 1 for visualization of bowtie structure of E.coli network.
Clustering coefficient
The clustering coefficient of node v measures the extent that its neighbours are also linked together, i.e., to form a clique[29]:
where N(v) denotes the number of links between neighbours of node v, d(v) is the degree of node v. The value of CC (v) is between 0 and 1. To some extent, the clustering coefficient of a network, i.e., the average of CC (v) over all v, could reflect the cliquishness of the network [29].
Modularity metric
For a given decomposition of a network, the modularity metric is defined as the fraction of arcs within clusters minus the expected fraction of edges if the arcs are wired with no structural bias [11]:
where r is the number of clusters, e_{ ij }is the fraction of arcs that leads between vertices of cluster i and j. Guimera et al. defined the modularity metric of a network as the largest modularity metric of all possible partitions of the network [17], and they also developed a simulated annealing algorithm to compute the modularity metric of a network [14, 18]. The simulated annealing algorithm identifies modules by maximizing the network's modularity parameter so that there are as many as withinmodule links and as few as possible betweenmodule links.
When being used for different ways of partition of the same network, the modularity metric can measure which partition is better. If used for different networks, the largest modularity metric can measure their modular extents. In this study, we applied this metric in both of the different ways. When decomposing the network by our algorithm, we detected the best cut of the hierarchical tree based on this metric. While comparing E.coli network with its randomized counterparts, we measured the modular extent of the network by its largest modularity metric computed by simulated annealing algorithm.
Algorithm to decompose the genomebased metabolic network
Usually, clustering of a graph starts with a dissimilarity matrix consisting of dissimilarity indexes, which quantitatively measure the extent that two vertices would like to be in the same subnetwork, and then attempt to divide the nodes into clusters such that dissimilarity between objects within the same cluster is minimized, while that between objects from different clusters is maximised. The main discrimination of different clustering methods is that they use their own dissimilarity index (see [7] for a review of different dissimilarity indexes). Our decomposition algorithm is similar to that of [16] which is based on the bowtie structure of metabolic networks, while a different dissimilarity index is used. The algorithm begins with decomposing the Core part into subnetworks that are still strongly connected, or most of the nodes are strongly connected. In the viewpoint of graph theory, nodes in the same strongly connected component are structurally equivalent in the sense that, (1) any pair of nodes within this component is mutually reachable from each other; (2) if an outside node can reach any node in this component, it can reach all of its nodes; (3) if a node of this component can reach any outside node, all nodes of this component can reach the same node.
In a directed graph, the distance d_{ ij }from node i to node j is defined as the number of arcs in the shortest directed path from i to j (in general, d_{ ij }â‰ d_{ ji }.). The distance between all node pairs can be computed by Floyd algorithm [28]. For any vertex i, the set {d_{i 1},...,d_{i,i1},d_{i,i+l},...,d_{ iN }} measures how far all the other nodes are located from it, while the set {d_{1i},...,d_{i1,i},d_{i+1,i},...,d_{ Ni }} measures the reverse distances, where N is the number of nodes in this network. If two nodes i and j would belong to the same cluster, the distance d_{ ik }and d_{ ki }(k â‰ i, j) should be quite similar to the distance d_{ jk }and d_{ kj }respectively, while nodes i and j which satisfy the condition d_{ ij }equals d_{ ji }would fall into the same cluster. Therefore, the dissimilarity index D (i, j) between vertex i and j can be defined as the corrected Euclideanlike dissimilarity [37],
This dissimilarity is compatible with the structural equivalence of nodes within a strongly connected component, where the three terms of this equation quantitatively measure the three aspects of the equivalence, respectively.
Having obtained the dissimilarity indexes, Ward's clustering, a hierarchically agglomerative clustering method, is used to decompose the network [38]. This method starts with each node being its own cluster, then at each step, combines the two most similar clusters to form a new cluster, until all the nodes have been combined into one cluster. The algorithm produces a hierarchical clustering tree, or a dendrogram, for the network. Finally, the decomposition of the Core part can be expanded to the global network by using the "majority rule" proposed by Ma and Zeng [16]. The algorithm steps are presented as follows:

1.
Remove all the linear branches of the GSC part and get the Core.

2.
Decompose the Core of the GSC by Ward's clustering based on the dissimilarity index of equation (1) and get its hierarchical clustering tree.

3.
Cut the hierarchical clustering tree into m clusters so that the value of modularity metric is the largest [11].

4.
Expand the clusters of the Core to the whole metabolic network by the "majority rule", i.e., the nodes that are directly connected to nodes in GSC are placed in the subset to which most of their neighbours in GSC belong; the other nodes are classified into corresponding subsets to which most of their neighbours belong.
It is worth to note that with the dissimilarity index of equation (1), nodes that belong to the same subtree own the highest degree of "structural equivalence", but are not necessarily connected to each other, see Figure S9(B) and S10(B) in Additional file 1 for an example. In part II of Additional file 1, we illustrate each step of this algorithm using a relatively small genomebased metabolic network of Aeropyrum pernix (ape).
In Additional file 3, we list metabolite abbreviations of ape network.
Algorithm to generate random networks
A method similar to that of Maslov et al. [20, 21] was used to generate an ensemble of randomized networks. This algorithm randomly reshuffles the links of the original network, while preserving the in and outdegree of each node, as well as the total number of directed and bidirected arcs. It is presented as follows:

1.
Partition all the arcs of the original network into directed arcs and bidirected arcs.

2.
Reshuffle the bidirected arcs: Randomly select a pair of bidirected arcs A â†” B and C â†” D. Rewire the two bidirected arcs to get links A â†” C and B â†” D, if there are neither directed nor bidirected arcs between the pair AC and BD respectively. Otherwise, abandon this pair and chose another pair of bidirected arcs. The last restriction prevents the appearance of multiple arcs between the same pair of nodes. In addition, the network should always remain connected during the rewiring process.

3.
Reshuffle the directed arcs: Randomly select a pair of directed arcs A â†’ B and C â†’ D. Rewire the two directed arcs to get links A â†’ D and C â†’ B. As in step 2, during the rewiring process, multiple links are prohibited, and the network should always remain connected.
Repeating step 2 and step 3 many times will generate a randomly connected counterpart of the original network.
Method to compare a real metabolic network with randomized ones
Following the scheme of Maslov et al. [21], we apply Zscore to quantify the difference between a real metabolic network and its randomized counterparts:
where P is the graph metric in the real network, \stackrel{\xc2\xaf}{P}_{ r }and Î”P_{ r }are the mean and standard deviation of the corresponding graph metric in the randomized ensemble.
References
Stelling J, Klamt S, Bettenbrock K, Schuster S, Gilles ED: Metabolic network structure determines key aspects of functionality and regulation. Nature 2002, 420: 190â€“193. 10.1038/nature01166
Wagner A, Fell DA: The small world inside large metabolic networks. Proc R Soc Lond B 2001, 268: 1803â€“1810. 10.1098/rspb.2001.1711
Jeong H, Tombor B, Albert R, Oltvai ZN, Barabasi AL: The largescale organization of metabolic networks. Nature 2000, 407: 651â€“654. 10.1038/35036627
Tanaka R: ScaleRich Metabolic Networks. Physical Review Letters 2005, 94: 168101. 10.1103/PhysRevLett.94.168101
Arita M: The metabolic world of Escherichia coli is not small. PNAS 2004, 101: 1543â€“1547. 10.1073/pnas.0306458101
Arita M: ScaleFreeness and Biological Networks. J Biochem (Tokyo) 2005, 138: 1â€“4.
Zhao J, Yu H, Luo J, Cao Z, Li Y: Complex networks theory for analyzing metabolic networks. Chinese Science Bulletin 2006, 51: 1529â€“1537. 10.1007/s1143400620152
Erdos P, Renyi A: On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Science 1960, 5: 17â€“61.
Hartwell LH, Hopfield JJ, Leibler S, Murray AW: From molecular to modular cell biology. Nature 1999, 402: C47C52. 10.1038/35011540
Papin JA, Reed JL, Palsson BO: Hierarchical thinking in network biology: the unbiased modularization of biochemical networks. Trends in Biochemical Sciences 2004, 29: 641â€“647. 10.1016/j.tibs.2004.10.001
Newman MEJ, Girvan M: Finding and evaluating community structure in networks. Physical Review E 2004, 69: 026113. 10.1103/PhysRevE.69.026113
Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabasi AL: Hierarchical Organization of Modularity in Metabolic Networks. Science 2002, 297: 1551â€“1555. 10.1126/science.1073374
Gagneur J, Jackson DB, Casari G: Hierarchical analysis of dependency in metabolic networks. Bioinformatics 2003, 19: 1027â€“1034. 10.1093/bioinformatics/btg115
Guimera R, Amaral LAN: Cartography of complex networks:modules and universal roles. Journal of Statistical Mechanics: Theory and Experiment 2005, P02001. 10.1088/17425468/2005/02/P02001
Holme P, Huss M, Jeong H: Subnetwork hierarchies of biochemical pathways. Bioinformatics 2003, 19: 532â€“538. 10.1093/bioinformatics/btg033
Ma HW, Zhao XM, Yuan YJ, Zeng AP: Decomposition of metabolic network into functional modules based on the global connectivity structure of reaction graph. Bioinformatics 2004, 20: 1870â€“1876. 10.1093/bioinformatics/bth167
Guimera R, SalesPardo M, Amaral LAN: Modularity from fluctuations in random graphs and complex networks. Physical Review E 2004, 70: 025101. 10.1103/PhysRevE.70.025101
Guimera R, Nunes Amaral LA: Functional cartography of complex metabolic networks. Nature 2005, 433: 895â€“900. 10.1038/nature03288
Ma HW, Zeng AP: The connectivity structure, giant strong component and centrality of metabolic networks. Bioinformatics 2003, 19: 1423â€“1430. 10.1093/bioinformatics/btg177
Maslov S, Sneppen K: Specificity and Stability in Topology of Protein Networks. Science 2002, 296: 910â€“913. 10.1126/science.1065103
Maslov S, Sneppen K, Zaliznyak A: Detection of topological patterns in complex networks: correlation profile of the internet. Physica A: Statistical and Theoretical Physics 2004, 333: 529â€“540. 10.1016/j.physa.2003.06.002
Goto S, Nishioka T, Kanehisa M: LIGAND: chemical database of enzyme reactions. Nucl Acids Res 2000, 28: 380â€“382. 10.1093/nar/28.1.380
Goto S, Okuno Y, Hattori M, Nishioka T, Kanehisa M: LIGAND: database of chemical compounds and reactions in biological pathways. Nucl Acids Res 2002, 30: 402â€“404. 10.1093/nar/30.1.402
Csete M, Doyle J: Bow ties, metabolism and disease. Trends in Biotechnology 2004, 22: 446â€“450. 10.1016/j.tibtech.2004.07.007
Dandekar T, Schuster S, Snel B, Huynen M, Bork P: Pathway alignment: application to the comparative analysis of glycolytic enzymes. Biochemical Journal 1999, 343: 115â€“124. 10.1042/02646021:3430115
Huynenb MA, Dandekarb T, Bork P: Variation and evolution of the citricacid cycle: a genomic perspective. Trends in Microbiology 1999, 7: 281â€“291. 10.1016/S0966842X(99)015395
Spirin V, Gelfand MS, Mironov AA, Mirny LA: A metabolic network in the evolutionary context: Multiscale structure and modularity. PNAS 2006, 103: 8774â€“8779. 10.1073/pnas.0510258103
Bondy JA, Murty USR: Graph theory with applications. London: Macmillan; 1976.
Watts DJ, Strogatz SH: Collective dynamics of 'smallworld' networks. Nature 1998, 393: 440â€“442. 10.1038/30918
Ma H, Zeng AP: Reconstruction of metabolic networks from genome data and analysis of their global structure for various organisms. Bioinformatics 2003, 19: 270â€“277. 10.1093/bioinformatics/19.2.270
Duarte NC, Herrgard MJ, Palsson BO: Reconstruction and Validation of Saccharomyces cerevisiae iND750, a Fully Compartmentalized GenomeScale Metabolic Model. Genome Res 2004, 14: 1298â€“1309. 10.1101/gr.2250904
Kitano H: Biological robustness. Nature Reviews Genetics 2004, 5: 826â€“837. 10.1038/nrg1471
Tanaka R, Csete M, Doyle J: Highly optimised global organisation of metabolic networks. IEE Proceedings â€“ Systems Biology 2005, 152: 179â€“184. 10.1049/ipsyb:20050042
Kitano H, Oda K: Robustness tradeoffs and hostmicrobial symbiosis in the immune system. Mol Syst Biol 2006, 2: E1E10. 10.1038/msb4100039
Kitano H, Oda K, Kimura T, Matsuoka Y, Csete M, Doyle J, Muramatsu M: Metabolic Syndrome and Robustness Tradeoffs. Diabetes 2004, 53: S6â€“15.
Marhl M, Perc M, Schuster S: Selective regulation of cellular processes via protein cascades acting as bandpass filters for timelimited oscillations. FEBS Letters 2005, 579: 5461â€“5465.
Batagelj V, Mrvar A, Ferligoj A, Doreian P: Generalized blockmodeling with Pajek. Metodoloski Zvezki 2004, 1: 455â€“467.
Ward J: Hierarchical grouping to optimize an objective function. J Amer Statist Assoc 1963, 58: 236â€“244. 10.2307/2282967
Batagelj V, Mrvar A: Pajekprogram for large network analysis. Connections 1998, 21: 47â€“57.
Acknowledgements
We thank Dr. R. GuimerÃ and Dr. L. A. N. Amaral for kindly providing us the software Modulw to compute network modularity metric; Dr. H.W. Ma and Dr. A.P. Zeng for providing us with their metabolic networks' database; Dr. J. Doyle and Dr. Y. Z. Chen for critical reading and constructive comments; and the anonymous reviewers for their constructive comments. This work was supported in part by grants from Ministry of Science and Technology China(2003CB715900, 04BA711A21, 2004CB720103), National Natural Science Foundation of China (30500107), and Science and technology commission of Shanghai municipality (04DZ19850, 04DZ14005).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Authors' contributions
JZ conceived of the study, designed the analysis, implemented the analysis and prepared the manuscript. HY helped JZ to implement the analysis. JHL managed the project. ZWC and YXL helped JZ to design the analysis, provided guidance, coordinated and participated in the biological and theoretical analyses, and revised the manuscript. All authors read and approved the final 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
Zhao, J., Yu, H., Luo, JH. et al. Hierarchical modularity of nested bowties in metabolic networks. BMC Bioinformatics 7, 386 (2006). https://doi.org/10.1186/147121057386
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/147121057386