Article |
Metabolic PathFinding: inferring relevant pathways in biochemical networks
SCMBB, Université Libre de Bruxelles Campus Plaine, CP 263, Boulevard du Triomphe, B-1050 Bruxelles, Belgium
*To whom correspondence should be addressed. Tel: +32 2 650 5466; Fax: +32 2 650 5425; Email: jvanheld{at}scmbb.ulb.ac.be
Received February 14, 2005. Revised March 25, 2005. Accepted March 25, 2005.
Our knowledge of metabolism can be represented as a network comprising several thousands of nodes (compounds and reactions). Several groups applied graph theory to analyse the topological properties of this network and to infer metabolic pathways by path finding. This is, however, not straightforward, with a major problem caused by traversing irrelevant shortcuts through highly connected nodes, which correspond to pool metabolites and co-factors (e.g. H2O, NADP and H+). In this study, we present a web server implementing two simple approaches, which circumvent this problem, thereby improving the relevance of the inferred pathways. In the simplest approach, the shortest path is computed, while filtering out the selection of highly connected compounds. In the second approach, the shortest path is computed on the weighted metabolic graph where each compound is assigned a weight equal to its connectivity in the network. This approach significantly increases the accuracy of the inferred pathways, enabling the correct inference of relatively long pathways (e.g. with as many as eight intermediate reactions). Available options include the calculation of the k-shortest paths between two specified seed nodes (either compounds or reactions). Multiple requests can be submitted in a queue. Results are returned by email, in textual as well as graphical formats (available in http://www.scmbb.ulb.ac.be/pathfinding/).
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  F. J. Planes and J. E. Beasley An optimization model for metabolic pathways Bioinformatics, October 15, 2009; 25(20): 2723 - 2729. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
L. F. de Figueiredo, S. Schuster, C. Kaleta, and D. A. Fell Can sugars be produced from fatty acids? A test case for pathway analysis tools Bioinformatics, January 1, 2009; 25(1): 152 - 158. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
L. F. de Figueiredo, S. Schuster, C. Kaleta, and D. A. Fell Can sugars be produced from fatty acids? A test case for pathway analysis tools Bioinformatics, November 15, 2008; 24(22): 2615 - 2621. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
T. Blum and O. Kohlbacher MetaRoute: fast search for relevant metabolic routes for interactive network navigation and visualization Bioinformatics, September 15, 2008; 24(18): 2108 - 2109. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 F. J. Planes and J. E. Beasley A critical examination of stoichiometric and path-finding approaches to metabolic pathways Brief Bioinform, September 1, 2008; 9(5): 422 - 436. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 S. Brohee, K. Faust, G. Lima-Mendez, O. Sand, R. Janky, G. Vanderstocken, Y. Deville, and J. van Helden NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways Nucleic Acids Res., July 1, 2008; 36(suppl_2): W444 - W451. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
J. E. Beasley and F. J. Planes Recovering metabolic pathways via optimization Bioinformatics, January 1, 2007; 23(1): 92 - 98. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
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]
|
|
|
|
|
|
S. A. Rahman and D. Schomburg Observing local and global properties of metabolic pathways: 'load points' and 'choke points' in the metabolic networks Bioinformatics, July 15, 2006; 22(14): 1767 - 1774. [Abstract] [Full Text] [PDF]
|
|