Skip Navigation


Nucleic Acids Research Advance Access originally published online on May 5, 2007
Nucleic Acids Research 2007 35(Web Server issue):W613-W618; doi:10.1093/nar/gkm287
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (1460K) Freely available
Right arrow Screen PDF (267K) Freely available
Right arrowOA All Versions of this Article:
35/suppl_2/W613    most recent
gkm287v1
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 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 Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Handorf, T.
Right arrow Articles by Ebenhöh, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Handorf, T.
Right arrow Articles by Ebenhöh, O.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2007, Vol. 35, No. suppl_2 W613-W618
© 2007 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Articles

MetaPath Online: a web server implementation of the network expansion algorithm

Thomas Handorf1 and Oliver Ebenhöh2,*

1Department of Theoretical Biophysics, Institute of Biology, Humboldt University Berlin, Invalidenstrasse 42, 10115 Berlin, Germany and 2University Hospital Charité Berlin, Institute of Biochemistry, Monbijoustrasse 2, 10117 Berlin, Germany

*To whom correspondence should be addressed. Email: oliver.ebenhoeh{at}rz.hu-berlin.de

Received January 30, 2007. Revised March 28, 2007. Accepted April 12, 2007.

We designed a web server for the analysis of biosynthetic capacities of metabolic networks. The implementation is based on the network expansion algorithm and the concept of scopes. For a given network and predefined external resources, called the seed metabolites, the scope is defined as the set of products which the network is in principle able to produce. Through the web interface the user can select a variety of metabolic networks or provide his or her own list of reactions. The information on the organism-specific networks has been extracted from the KEGG database. By choosing an arbitrary set of seed compounds, the user can obtain the corresponding scopes. With our web server application we provide an easy to use interface to perform a variety of structural and functional network analyses. Problems that can be addressed using the web server include the calculation of synthesizing capacities, the visualization of synthesis pathways, functional analysis of mutant networks or comparative analysis of related species. The web server is accessible through http://scopes.biologie.hu-berlin.de.


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
 GeneticsHome page
P. May, S. Wienkoop, S. Kempa, B. Usadel, N. Christian, J. Rupprecht, J. Weiss, L. Recuenco-Munoz, O. Ebenhoh, W. Weckwerth, et al.
Metabolomics- and Proteomics-Assisted Genome Annotation and Analysis of the Draft Metabolic Network of Chlamydomonas reinhardtii
Genetics, May 1, 2008; 179(1): 157 - 166.
[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.