Searching the Resource Information Network
Are you sure you want to leave this community? Leaving the community will revoke any permissions you have been granted in this community.
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/).
Pubmed ID: 15980483
Publication data is provided by the National Library of Medicine ® and PubMed ®. Data is retrieved from PubMed ® on a weekly schedule. For terms and conditions see the National Library of Medicine Terms and Conditions.
THIS RESOURCE IS NO LONGER IN SERVICE.Documented on January 4,2023.Software tools that have been developed by AT&T Labs researchers. In addition to the software tools available through Open Source and Non-Commercial licenses as listed on this page, AT&T has additional software and technology solutions available for licensing. Please reference the individual project web pages for specific license agreements. If an available license agreement does not meet your needs, please contact attip (at) att.com for assistance with a customized license. Open Source Licenses * AST: Advanced Software Technologies Open Source Collection * Cdt: Container Data Types Library * ECharts: A state machine-based programming language * GGobi: Data visualization for high-dimensional data * GSDjVu/DjVuDigital: Ghostscript driver to convert PS and PDF files to DjVu files * Graphviz: Tools for viewing and interacting with graph diagrams * PADS: Processing Arbitrary Data Streams * Sfio: Portable library for performing I/O * UWIN: Unix on Windows 95 and NT Machines * Vcodex: Software package for data transformation * WSP: Web Scraping Proxy * Yoix: The Yoix Scripting Language and Interpreter * iPlots: Interactive graphics for data analysis in R * vmalloc: Region Memory Allocator Non-Commercial Binary Licenses * BoosTexter: A general purpose machine-learning program * Hancock: A language for processing large-scale data Non-Commercial Source Licenses * ASDT: The AT&T Statistical Dialog Toolkit (ASDT) * Hancock: A language for processing large-scale data
View all literature mentions