Structural comparison of metabolic networks in selected single cell organisms
© Zhu and Qin; licensee BioMed Central Ltd. 2005
Received: 20 July 2004
Accepted: 14 January 2005
Published: 14 January 2005
There has been tremendous interest in the study of biological network structure. An array of measurements has been conceived to assess the topological properties of these networks. In this study, we compared the metabolic network structures of eleven single cell organisms representing the three domains of life using these measurements, hoping to find out whether the intrinsic network design principle(s), reflected by these measurements, are different among species in the three domains of life.
Three groups of topological properties were used in this study: network indices, degree distribution measures and motif profile measure. All of which are higher-level topological properties except for the marginal degree distribution. Metabolic networks in Archaeal species are found to be different from those in S. cerevisiae and the six Bacterial species in almost all measured higher-level topological properties. Our findings also indicate that the metabolic network in Archaeal species is similar to the exponential random network.
If these metabolic network properties of the organisms studied can be extended to other species in their respective domains (which is likely), then the design principle(s) of Archaea are fundamentally different from those of Bacteria and Eukaryote. Furthermore, the functional mechanisms of Archaeal metabolic networks revealed in this study differentiate significantly from those of Bacterial and Eukaryotic organisms, which warrant further investigation.
Classification of biological organisms is of fundamental importance to evolutionary studies. It is commonly believed that there are three domains of life: Archaea, Bacteria and Eukaryote. Currently, the most popular classification method is the so called "molecular approach", in which polymorphism information in DNA or protein sequence is exploited to assess the phylogenetic relationships among species [1, 2]. To a large extent, this is a "local" approach since the choice of sequence for comparison greatly affects the final result, "lateral gene transfer" (LGT) and thus the resulting "genome chimerism" further complicates the situation . A new "system" approach that takes "global" properties of each organism into consideration serves as a potential alternative to overcome this shortcoming. Indeed, recent advances in system biology and increasingly available genomic databases have made it possible to rebuild biological networks from genomic data and have offered opportunity for such a "system" approach .
Podani and co-workers  proposed classifying organisms based on two kinds of network indices: the Jaccard index, which measures proportions of common sets of nodes in two networks, and Goodman-Kruskal γ function, which measures the similarity between rankings of nodes in two networks. They studied metabolic and information network structures of 43 organisms using these two measures under the hypothesis that network structure and the network design principle(s) behind them contain phylogenetic information. Ma and Zeng  conducted a more extensive phylogenetic classification study on 82 fully sequenced organisms based on different cellular function systems (enzyme, reaction, and genes) at the genomic level. They constructed phylogenetic tree based on Jaccard index and Korbel's definition, and concluded that in general, the classification based on network indices are in good agreement with the one obtained by analyzing the 16S rRNA using molecular approach. These studies seem to support the notion that significant differences in the network design principle(s) exist among the three domains of life . These differences may reflect on the different approaches that organisms take to organize their entire systems to serve their special needs in the environment they live during the evolutionary history. Motivated by these encouraging results, in this manuscript, we went on to conduct a thorough comparison of network structural properties which provide further and more compelling evidences that significant differences exist among the network design principle(s) in organisms from the three domains of life.
Restricted by the theoretical network structural studies, there are not many deterministic and informative topological measurements available [8–11]. The established measurements can be roughly divided into two categories: higher-level (global) properties and low-level (local) properties. The difference between the two is that one needs to know the whole network in order to calculate the higher-level property measures (e.g. average path length) while the low-level properties can be worked out locally (e.g. marginal degree of individual node) . We use three groups of topological measurements (both low and higher-level) that address different aspects of the network structure. The first group contains network indices such as average clustering coefficient, average path length . The second group is composed of degree distributions (both marginal and bivariate joint degree distributions) [8–11, 13]. The third group is composed of network motif profiles that are recently shown to represent the network design principle(s) and global statistical properties of the network when aggregating together [14–16]. These measurements have been well studied in the network literatures, and are able to capture most aspects of network degree information.
Single cell model organisms such as E. coli and S. cerevisiae have been studied intensively in biochemistry, cell biology and genetics; hence the rebuilt networks in those organisms present the best chance to approximate the true underlying network. Moreover, single cell organisms are less likely to have experienced the Whole Genome Duplication (WGD), which might drastically change the network structure [17, 18]. As a result, we selected eleven single cell organisms to study their network structural properties: one Eukaryote: S. cerevisiae; six Bacteria: E. coli, V. cholerae, R. solanacearum, B. subtilis, L. lactis, S. coelicolor; and four Archaea: S. solfataricus, S. tokodaii, M. acetivorans, T. acidophilum.
There are three main types of intracellular networks: the protein-protein interaction network, the transcriptional regulation network and the metabolic network. The first two are rebuilt by using high throughput techniques such as yeast two-hybrid system, in vivo pull down assay or DNA microarray, which are subject to high uncertainties, and the resulting networks may not be good approximation to biological complexity [19–22]. On the other hand, the metabolic network is derived from metabolic pathways, many of which are inferred from biochemical experiment-defined stoichiometries of many reactions . It is well known that central pathways contain "hub nodes" of the whole metabolic network [24, 25] and are also main building blocks of the so-called Giant Strongly Connected Component (GSCC) and Giant Weakly Connected Components (GWCC) . The former is defined as the largest cluster of nodes within which any pair of nodes is mutually reachable from each other, and the latter is defined as the largest cluster of nodes within which each pair of nodes is connected in the underlying undirected graph . Therefore, our high confidence in the structure of GSCC and GWCC, based on experimentally verified pathways, guarantees high confidence in whole network structure. The long history of biochemical studies of enzymes ensures relatively low false positive and low false negative rates of connections. Therefore, we decided to use metabolic networks in single cell organisms to compare network topological properties in the three domains of life.
In constructing metabolic networks, Ma and Zeng  argued that connections through "current metabolites", which is referred to as cofactors in biochemistry such as ATP, ADP, H2O, should be removed from metabolic networks. We followed their suggestions by removing such "current metabolites" before conducting the following analysis.
Group I measures: network indices
Descriptive statistics of metabolic networks in the eleven organisms.
DOMAIN, KINGDOM AND PHYLUM
Group II measures: degree distributions
Marginal degree distributions
Parameter estimates of γ and logα in the outgoing degree distribution model.
γ, 95% C.I.
logα, 95% C.I.
-0.39, [-0.46, -0.31]
2.53, [2.29, 2.78]
-0.36, [-0.43, -0.28]
2.51, [2.29. 2.74]
-0.36, [-0.44, -0.28]
2.45, [2.22, 2.68]
-0.37, [-0.43, -0.31]
2.50, [2.32, 2.68]
-0.36, [-0.44, -0.28]
2.46, [2.23, 2.68]
-0.38, [-0.45, -0.31]
2.39, [2.20, 2.58]
-0.36, [-0.43, 0.30]
2.47, [2.29, 2.65]
-0.33, [-0.43, -0.23]
2.17, [1.86, 2.49]
-0.34, [-0.42, -0.25]
2.15, [1.88, 2.42]
-0.37, [-0.44, -0.31]
2.25, [2.05, 2.45]
-0.33, [-0.46, -0.20]
2.13, [1.73, 2.53]
Parameter estimates of α and γ in the incoming degree distribution model.
γ, 95% C.I.
logα, 95% C.I.
-0.35, [-0.42, -0.29]
2.38, [2.18, 2.59]
-0.35, [-0.42, -0.28]
2.50, [2.29, 2.70]
2.45, [2.22, 2.68]
-0.37, [-0.42, -0.31]
2.50, [2.32, 2.68]
-0.36, [-0.43, -0.28]
2.46, [2.23, 2.68]
-0.38, [-0.45, -0.31]
2.40, [2.20, 2.58]
-0.36, [-0.43, -0.30]
2.47, [2.29, 2.65]
-0.24, [-0.41, -0.07]
2.21, [1.76, 2.68]
-0.25, [-0.42, -0.08]
2.21, [1.76, 2.65]
-0.30, [-0.41, -0.20]
2.00, [1.69, 2.32]
-0.25, [-0.43, -0.08]
2.20, [1.75, 2.65]
As we have shown, marginal degree distribution alone does not reveal the fundamental network structural differences between the Archaeal species and the non-Archaeal species. Simulation studies have shown that randomized networks preserving marginal degree distribution can be quite different in terms of global (higher level) topological properties such as average clustering coefficient . In metabolic networks, we are unable to determine the preferred types of reactions based on just marginal substrate or product degree distributions. Since the metabolic network is rebuilt from chemical reactions, joint behavior of substrate and product in reactions should be more informative than disjoint behavior of metabolites. Therefore, we calculate the joint degree distributions hoping to gain more insight into the network organization.
Joint degree distributions
Joint degree distribution measures and describes correlation between connectivities of neighboring nodes. N(K0, K1) is defined as the number of edges connecting nodes of connectivity K0 to those of connectivity K1. For metabolic networks, which are directed, N(K out , K in ) is used to measure the number of arches where substrate (node) with out-connectivity K out transforms to product with in-connectivity K in . This quantity reflects intrinsic properties of the network and can be used to distinguish different types of networks. For instance, we can test whether N(K out , K in ) of a particular network differs significantly from that of the random network. To be specific, we calculate , where (K out , K in ) represents the mean of random variable N(K out , K in ) in a large number (say, 1000) of random networks simulated by an edge-rewiring algorithm proposed by Maslov and Sneppen , (K out , K in ) denotes the estimated standard deviation of N(K out , K in ). The p-value can then be obtained by compare Z to a standard normal distribution. Comparing with "properly" randomized network ensembles allows us to concentrate on those statistically significant patterns of the complex network that are likely to reflect the design principle(s) .
Group III measure: Network Motif
The network motif is defined to be recurring and non-random building blocks of the network [14, 15]. Just like sequence motif, which is an over-represented and biologically meaningful DNA or protein sub-sequence, network motif is an over-represented and biologically meaningful subgraph.
Network motif has been shown to be informative of network design principle(s) and network structure. It was found that over 80% of the nodes in the E. coli transcription regulation network are covered by network motifs . Dobrin et al.  recently discovered that in the E. coli transcriptional regulatory network, "individual motifs aggregate into homologous motif clusters and a supercluster forming the backbone of the network and play a central role in defining its global topological organization." More importantly, network motifs capture the information that is likely to be missed by the correlation profiles because motif actually describes the number of appearances of certain configurations of multiple nodes, and therefore nicely complement with the correlation profiles . One might argue that there are certain amount of overlaps between the information they capture but the motif profile does not capture the degree information of the connecting nodes, which may be the most powerful feature of the correlation profiles.
Based on our comparison of network structural properties beyond network indices, we were able to gain more insight into the structural differences across the three domains of life. Having shown that the metabolic network is "scale-free", we further showed that metabolic networks in the four Archaeal species are closer to "exponential random network" [9:Ch2, ] than those in S. cerevisiae and the six Bacterial species. The reasons are the following:
First, the Archaeal metabolic networks are visually more homogeneous among themselves compared to their counterparts in the non-Archaeal species. In random networks, any pair of nodes is equally likely to be connected. The network topology should look homogeneous given that the size of network is large enough. The "scale-free" network, on the other hand, features a highly modular and heterogeneous topology since the marginal degree is power-law distributed [8, 9]. Moreover, the marginal degree distributions of the metabolic networks in non-Archaeal species fit the power-law model better than Archaeal species (Table 2 and Table 3).
Second, the average clustering coefficient and average betweenness of Archaeal metabolic networks are much smaller than those in S. cerevisiae and the six Bacterial species. The same is true for the concentrations of three-node and four-node subgraphs. As pointed out by Watts and Strogatz, real-life networks show strong clustering or network transitivity while exponential random network does not .
Third, there is no three-node motif and fewer four-node motifs found in Archaeal metabolic networks compared to non-Archaeal metabolic networks. In particular, the ubiquitous feed-forward loop (FFL) motif found in networks from biology (including metabolic networks in S. cerevisiae and the six Bacteria species in this study) to neurology and engineering fields was not found in any of the four Archaeal metabolic networks (Fig. 6). Since motifs are statistically significant subgraphs compared to "properly" randomized network ensembles, no motif or fewer than usual motifs found in a real-life network indicates that the network structure is closer to that of a random network. It has been shown by Milo et al.  that concentration of FFL motif is insensitive to the network size within E. coli transcription regulation network, but diminishes to zero in increasingly larger random networks. This also supports that Archaeal metabolic networks are closer to randomized network ensembles than other real-life networks.
The metabolic networks in Archaea are both "random-like" and "scale-free", which might exert profound influences on their adaptability to the hostile environment. Archaeal species are typically restricted to marginal habitats such as hot springs or areas of low oxygen concentration and can assimilate different kinds of inorganic carbon and nitrogen sources. Indeed, the chemical structure and component of the macromolecules such as protein and lipid make significant contributions to the organism's adaptability to the environment. The seemingly ad hoc network organization (both "random-like" and "scale-free") in Archaeal species might also enabled them to survive in those extreme physiological conditions. Archaeal species might employ some biologically significant subgraphs (rather than statistically significant motifs) which can not be detected by current motif searching algorithm . This makes the Archaeal metabolic networks appear random in statistical sense (not statistically significantly different from random networks) but not in biological sense.
Our comparison results showed that many network structural properties measured in Archaeal species are different from those of non-Archaeal species. However, the hidden anthropomorphic factors might account for some of the differences observed. Specifically, the drastic differences of topological profiles between the metabolic networks of Archaeal species and non-Archaeal species may be partially explained by the fact that significantly less extensive metabolic pathway studies have been conducted in Archaeal species . Robustness of topological profiles against random perturbations can alleviate the impact to a certain extent but is unable to eradicate it .
Our network analysis results showed that in most of higher-level (global) topological properties measured, metabolic networks in the four Archaeal species are similar to each other but significantly different from those in S. cerevisiae and the six Bacterial species. This provides further evidence that the metabolic network structures and consequently the design principle(s) in the four Archaeal species are very different from those in S. cerevisiae (Eukaryote) and the six Bacterial species. Our finding that the metabolic networks in Archaeal species possess many properties of the exponential random network begs for better understanding of the design principle(s) in biological networks, which may be revealed by further systematic analyses. For example, locate and align conservative pathways such as glycosis between E. coli or S. cerevisiae and Archaeal species to understand the functional mechanisms of Archaeal metabolic networks.
Chemical reaction data was obtained from metabolic database in Ma and Zeng , which consists of five related tables: reaction, enzyme, react, connect and organism. We compiled a new table from this database excluding any inconsistent or redundant connections between metabolites (details below). SQL was used to query the database.
Identify and remove inconsistency
Inconsistent connections refer to pairs of metabolites that have conflicting reversibility annotation. It is caused by the fact that a pair of metabolites can be in more than one reaction and the reversibility of these reactions can be different. For example, NAD+ and Nicotinamide is a pair of metabolites in two reactions: 1) NAD+ + L-Arginine = Nicotinamide + N2 (ADP-D-ribosyl)-L-arginine 2) NAD+ + H2O ->Nicotinamide + ADPribose. (Note that here the role of NAD+ is NOT "current" metabolite, and hence connections established through it should NOT be removed). Reaction 1 is a reversible reaction while reaction 2 is not. We annotated an edge between the two metabolites as long as there was at least one reversible reaction that both of them were involved. For example, the type of connection between NAD+ and Nicotinamide is edge (undirected connection). This step could be summarized as "edge ← edge + arc".
Identify and remove redundancy
There are also numerous redundant connections where the same pair of metabolites switch their roles between substrate and product in two or more different irreversible reactions. For example: 1) UDPglucose + N-Acylsphingosine = UDP + Glucosylceramide 2) Glucosylceramide + H2O = D-Glucose + N-Acylsphingosine. (N-Acylsphingosine and Glucosylceramide is a pair of metabolites that switch their roles in two irreversible reactions). In case of redundancy, we annotated an edge between the pair of metabolites rather than the two arcs because they could be converted to each other through two reactions. This step could be summarized as "edge ← arc + arc".
Definitions of some network topological measurements
Clustering coefficient (C)
We define two kinds of clustering coefficients for each node in the directed metabolic networks, i.e. C in and C out . C in measures the average clustering coefficient of the node representing the product that can be generated from its first-order "nearest neighbors" through chemical reactions. C out measures the average clustering coefficient of the node that generate its first-order "nearest neighbors" through chemical reactions. The larger the coefficients, the more clustered and modular the network appears to be.
The betweenness for any node n i in the network is defined as , where g jk is the number of shortest paths between node j and node k. g jk (n i ) is the number of shortest path between node j and node k containing node n i , g is the total number of nodes with edges/arcs. C B (n i ) needs to be multiplied by two in the case of directed network . The average betweenness is defined as: . Higher value of betweenness indicates the network is more clustered and modular.
Average path length (L)
Watts and Strogatz  defined the average path length as , where d(j, k) is the shortest path length between node j and node k (distance), V represents the set of all nodes with edges/arcs of the graph, and g is the number of nodes with edges/arcs.
The diameter of the directed graph G is the longest geodesic between any pairs of nodes. The geodesic is the shortest path between a pair of nodes. Pajek  was used to calculate the average betweenness, average path length and diameter.
Concentration of subgraphs (S)
Wasserman and Katherine  defined the subgraph as follows: A graph G s is a subgraph of G if the set of nodes of G s is a subset of the set of nodes of G, and the set of lines in G s is a subset of the lines in the graph G. Let M be the number of subgraphs, and N be the number of nodes with edges or arcs. Then the "concentration of subgraph" is defined as C = M/N. A high value of C indicates the network is more clustered and modular. Mfinder1.1  was used to calculate both M and N.
Marginal degree distribution calculations
The marginal degree distribution of each network is calculated from the Boolean adjacency matrix A, a matrix of 0 or 1. Zero means there is no connection between nodes, and 1 the opposite. The outgoing degree of the node i, kout(i)is defined as , where . The incoming degree of the node i, kin(i)is defined as .
Simple regression analyses of marginal degree distributions
The power-law degree model was first log transformed into linear model, i.e. log P(K i ) = γ log(K i ) + log(α) + ε i (i = 1,2,...,n), γ and α are parameters, ε i is the residual. K i is the degree and P(K i ) is the corresponding probability. Based on the fitted linear model, we made statistical inference including parameter estimation and individual confidence intervals on the estimates using the Least Square method.
Correlation profile calculations
Statistically significant correlation profiles were calculated using Matlab code downloaded from Dr. Maslov's website . The adjacency matrix of the network is the input.
Motif profiles calculations
According to Milo et al. , a subgraph is referred to as a motif if the following criteria are met: 1) Its empirical p-value is smaller than a pre-specified threshold, e.g. 0.01. 2) The number of appearances in real networks with distinct sets of nodes is larger than another pre-specified cut-off value, e.g. 4. 3) The number of appearances in real networks is significantly larger than that in randomized networks, i.e. . N real and N rand represent the number of certain subgraphs detected in real-life network and randomized networks, respectively. This is to avoid the situation where some common subgraphs are detected as motifs that have only slight differences in N real and N rand but have a narrow spread of distribution in randomized networks [14, 15]. Motif profiles are generated using the Mfinder program. This program and the motif dictionary were downloaded from Dr. Uri Alon group's website .
We thank Drs. Hong-Wu Ma and An-Ping Zeng for their compiled metabolic database; Dr. Kerby A. Shedden for valuable discussion and the two anonymous reviewers for their constructive comments
- Woese C: The universal ancestor. Proc Natl Acad Sci U S A 1998, 95: 6854–6859. 10.1073/pnas.95.12.6854PubMed CentralView ArticlePubMedGoogle Scholar
- Doolittle WF: Phylogenetic classification and the universal tree. Science 1999, 284: 2124–2129. 10.1126/science.284.5423.2124View ArticlePubMedGoogle Scholar
- Martin W: Mosaic bacterial chromosomes: a challenge en route to a tree of genome. Bioessays 1999, 21: 99–104.View ArticlePubMedGoogle Scholar
- Bray D: Molecular networks: the top-down view. Science 2003, 301: 1864–1865. 10.1126/science.1089118View ArticlePubMedGoogle Scholar
- Podani J, Oltvai ZN, Jeong H, Tombor B, Barabási AL, Szathmáry E: Comparable system-level organization of Archaea and Eukaryotes. Nat Genet 2001, 29: 54–56. 10.1038/ng708View ArticlePubMedGoogle Scholar
- Ma HW, Zeng AP: Phylogenetic comparison of metabolic capacities of organisms at genome level. Mol Phylogenet Evol 2004, 31: 204–213. 10.1016/j.ympev.2003.08.011View ArticlePubMedGoogle Scholar
- Wolf YI, Karev G, Koonin EV: Scale-free networks in biology: new insights into the fundamentals of evolution? Bioessays 2002, 24: 105–109. 10.1002/bies.10059View ArticlePubMedGoogle Scholar
- Albert R, Barabási AL: Statistical mechanics of complex networks. Rev Mod Phy 2002, 74: 47–97. 10.1103/RevModPhys.74.47View ArticleGoogle Scholar
- Bornholdt S, Schuster HG: Handbooks of Graphs and Networks: From the Genome to the Internet. Weinheim: Wiley-Vch; 2003.Google Scholar
- Pemmaraju S, Skiena S: Computational discrete mathematics: Combinatorics and Graph Theory with Mathematica®. Cambridge: Cambridge University Press; 2003.View ArticleGoogle Scholar
- Newman MEJ: The structure and function of complex networks. SIAM Review 2003, 45: 167–256. 10.1137/5003614450342480View ArticleGoogle Scholar
- Watts DJ, Strogatz SH: Collective dynamics of 'small-world' networks. Nature 1998, 393: 440–442. 10.1038/30918View ArticlePubMedGoogle Scholar
- Maslov S, Sneppen K: Specificity and stability in topology of protein networks. Science 2002, 296: 910–913. 10.1126/science.1065103View ArticlePubMedGoogle Scholar
- Shen-Orr SS, Milo R, Mangan S, Alon U: Network motifs in the transcriptional regulation network of Escherichia coli. Nat Genet 2002, 31: 64–68. 10.1038/ng881View ArticlePubMedGoogle Scholar
- Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U: Network motifs: simple building blocks of complex networks. Science 2002, 298: 824–827. 10.1126/science.298.5594.824View ArticlePubMedGoogle Scholar
- Dobrin R, Beg QK, Barabási AL Oltvai ZN: Aggregating of topological motifs in the Escherichia coli transcriptional regulatory network. BMC Bioinformatics 2004, 5: 10. 10.1186/1471-2105-5-10PubMed CentralView ArticlePubMedGoogle Scholar
- Skrabanek L, Wolfe KH: Eukaryote genome duplication – where's the evidence? Curr Opin Genet Dev 1998, 8: 694–700. 10.1016/S0959-437X(98)80039-7View ArticlePubMedGoogle Scholar
- Wolfe KH, Shields DC: Molecular evidence for an ancient duplication of the entire yeast genome. Nature 1997, 387: 708–713. 10.1038/42711View ArticlePubMedGoogle Scholar
- Uetz P, Giot L, Cagney G, Mansfield TA, Judson RS, Knight JR, Lockshon D, Narayan V, Srinivasan M, Pochart P, Qureshi-Emili A, Li Y, Godwin B, Conover D, Kalbfleisch T, Vijayadamodar G, Yang M, Johnston M, Fields S, Rothberg JM: A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae. Nature 2000, 403: 623–627. 10.1038/35001009View ArticlePubMedGoogle Scholar
- Ito T, Chiba T, Ozawa R, Yoshida M, Hattori M, Sakaki Y: A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proc Natl Acad Sci U S A 2001, 98: 4569–4574. 10.1073/pnas.061034498PubMed CentralView ArticlePubMedGoogle Scholar
- Tong AH, Evangelista M, Parsons AB, Xu H, Bader GD, Page N, Robinson M, Raghibizadeh S, Hogue CW, Bussey H, Andrews B, Tyers M, Boone C: Systematic genetic analysis with ordered arrays of yeast deletion mutants. Science 2001, 294: 2364–2368. 10.1126/science.1065810View ArticlePubMedGoogle Scholar
- Lee TI, Rinaldi NJ, Robert F, Odom DT, Bar-Joseph Z, Gerber GK, Hannett NM, Harbison CR, Thompson CM, Simon I, Zeitlinger J, Jennings EG, Murray HL, Gordon DB, Ren B, Wyrick JJ, Tagne J, Volkert TL, Fraenkel E, Gifford DK, Young RA: Transcriptional regulatory networks in Saccharomyces cerevisiae. Science 2002, 298: 799–804. 10.1126/science.1075090View ArticlePubMedGoogle Scholar
- Papin JA, Price ND, Wiback SJ, Fell DA, Palsson BO: Metabolic pathways in the post-genomic era. TRENDS in Biochem Sci 2003, 28: 250–258. 10.1016/S0968-0004(03)00064-1View ArticleGoogle Scholar
- Fell DA, Wagner A: The small world of metabolism. Nat Biotechnol 2000, 18: 1121–1122. 10.1038/81025View ArticlePubMedGoogle Scholar
- Jeong H, Tombor B, Albert R, Oltvai ZN, Barabási AL: The large-scale organization of metabolic networks. Nature 2000, 407: 651–654. 10.1038/35036627View ArticlePubMedGoogle Scholar
- Ma HW, Zeng AP: The connectivity structure, giant strong component and centrality of metabolic networks. Bioinformatics 2003, 19: 1423–1430. 10.1093/bioinformatics/btg177View ArticlePubMedGoogle Scholar
- Wasserman S, Katherine F: Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press; 1994.View ArticleGoogle Scholar
- Ma HW, 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.270View ArticlePubMedGoogle Scholar
- Yook SH, Oltvai ZN, Barabási AL: Functional and topological characterization of protein interaction networks. Proteomics 2004, 4: 928–942. 10.1002/pmic.200300636View ArticlePubMedGoogle Scholar
- Farkas I, Jeong H, Vicsek T, Barabási AL, Oltvai ZN: The topology of transcription regulatory network in the yeast, Saccharomyces cerevisiae. Physica A 2003, 318: 601–612. 10.1016/50378-4371(02)01731-4View ArticleGoogle Scholar
- Jeong H, Mason SP, Barabási AL, Oltvai ZN: Lethality and centrality in protein networks. Nature 2001, 411: 41–42. 10.1038/35075138View ArticlePubMedGoogle Scholar
- Sakuraba H, Kawakami R, Takahashi H, Ohshima T: Novel archaeal alanine: glyoxylate aminotransferase from Thermococcus litoralis . J Bacteriol 2004, 186: 5513–5518. 10.1128/JB.186.16.5513-5518.2004PubMed CentralView ArticlePubMedGoogle Scholar
- Batagelj V, Mrvar A: Pajek – Program for large network analysis. Connections 1998, 21: 47–57.Google Scholar
- Dr. Maslov's Matlab Programs for Random Rewiring and Correlation Profiles of a Complex Network[http://www.cmth.bnl.gov/~maslov/matlab.htm]
- Dr. Uri Alon Lab Homepage[http://www.weizmann.ac.il/mcb/UriAlon/]
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 cited.