Skip Navigation


Bioinformatics Advance Access originally published online on March 22, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Supplementary data
Right arrow All Versions of this Article:
20/12/1870    most recent
bth167v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (29)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ma, H.-W.
Right arrow Articles by Zeng, A.-P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ma, H.-W.
Right arrow Articles by Zeng, A.-P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(12) © Oxford University Press 2004; all rights reserved.

Decomposition of metabolic network into functional modules based on the global connectivity structure of reaction graph

Hong-Wu Ma 1, Xue-Ming Zhao 2, Ying-Jin Yuan 2 and An-Ping Zeng 1,*

1 Department of Genome Analysis, GBF—German Research Center for Biotechnology Mascheroder Weg 1, 38124 Braunschweig, Germany and 2 Department of Bioengineering, Tianjin University, 300072, Tianjin, People's Republic of China

Received on August 24, 2003; revised on November 11, 2003; accepted on January 14, 2004
Advance Access Publication March 22, 2004

Motivation: Metabolic networks are organized in a modular, hierarchical manner. Methods for a rational decomposition of the metabolic network into relatively independent functional subsets are essential to better understand the modularity and organization principle of a large-scale, genome-wide network. Network decomposition is also necessary for functional analysis of metabolism by pathway analysis methods that are often hampered by the problem of combinatorial explosion due to the complexity of metabolic network. Decomposition methods proposed in literature are mainly based on the connection degree of metabolites. To obtain a more reasonable decomposition, the global connectivity structure of metabolic networks should be taken into account.

Results: In this work, we use a reaction graph representation of a metabolic network for the identification of its global connectivity structure and for decomposition. A bow-tie connectivity structure similar to that previously discovered for metabolite graph is found also to exist in the reaction graph. Based on this bow-tie structure, a new decomposition method is proposed, which uses a distance definition derived from the path length between two reactions. An hierarchical classification tree is first constructed from the distance matrix among the reactions in the giant strong component of the bow-tie structure. These reactions are then grouped into different subsets based on the hierarchical tree. Reactions in the IN and OUT subsets of the bow-tie structure are subsequently placed in the corresponding subsets according to a ‘majority rule’. Compared with the decomposition methods proposed in literature, ours is based on combined properties of the global network structure and local reaction connectivity rather than, primarily, on the connection degree of metabolites. The method is applied to decompose the metabolic network of Escherichia coli. Eleven subsets are obtained. More detailed investigations of the subsets show that reactions in the same subset are really functionally related. The rational decomposition of metabolic networks, and subsequent studies of the subsets, make it more amenable to understand the inherent organization and functionality of metabolic networks at the modular level.

Supplementary Information: http://genome.gbf.de/bioinformatics/

Contact: aze{at}gbf.de

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Physiol. GenomicsHome page
Y. Noguchi, N. Shikata, Y. Furuhata, T. Kimura, and M. Takahashi
Characterization of dietary protein-dependent amino acid metabolism by linking free amino acids with transcriptional profiles through analysis of correlation
Physiol Genomics, August 14, 2008; 34(3): 315 - 326.
[Abstract] [Full Text] [PDF]


Home page
Brief Funct Genomic ProteomicHome page
J. Noirel, S. Y. Ow, G. Sanguinetti, A. Jaramillo, and P. C. Wright
Automated extraction of meaningful pathways from quantitative proteomics data
Brief Funct Genomic Proteomic, March 7, 2008; (2008) eln011v1.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Q. Wang, Y. Yang, H. Ma, and X. Zhao
Metabolic network properties help assign weights to elementary modes to understand physiological flux distributions
Bioinformatics, May 1, 2007; 23(9): 1049 - 1052.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
T. Aittokallio and B. Schwikowski
Graph-based methods for analysing networks in cell biology
Brief Bioinform, September 1, 2006; 7(3): 243 - 255.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
D. Zhu, A. O Hero, H. Cheng, R. Khanna, and A. Swaroop
Network constrained clustering for gene microarray data
Bioinformatics, November 1, 2005; 21(21): 4014 - 4020.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
A. A. Petti and G. M. Church
A network of transcriptionally coordinated functional modules in Saccharomyces cerevisiae
Genome Res., September 1, 2005; 15(9): 1298 - 1306.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.