Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
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 (24)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Becker, M. Y.
Right arrow Articles by Rojas, I.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Becker, M. Y.
Right arrow Articles by Rojas, I.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 5 2001
Pages 461-467
© 2001 Oxford University Press

A graph layout algorithm for drawing metabolic pathways

Moritz Y. Becker * and Isabel Rojas

Scientific Databases and Visualization Group, European Media Laboratory, Schloss-Wolfsbrunnenweg 33, D-69118 Heidelberg, Germany

Received on September 9, 2000 ; revised on December 6, 2000 ; accepted on January 16, 2001

Motivation: A large amount of data on metabolic pathways is available in databases. The ability to visualise the complex data dynamically would be useful for building more powerful research tools to access the databases. Metabolic pathways are typically modelled as graphs in which nodes represent chemical compounds, and edges represent chemical reactions between compounds. Thus, the problem of visualising pathways can be formulated as a graph layout problem. Currently available visual interfaces to biochemical databases either use static images or cannot cope well with more complex, non-standard pathways.

Results: This paper presents a new algorithm for drawing pathways which uses a combination of circular, hierarchic and force-directed graph layout algorithms to compute positions of the graph elements representing main compounds and reactions. The algorithm is particularly designed for cyclic or partially cyclic pathways or for combinations of complex pathways. It has been tested on five sample pathways with promising results.

Availability: On request from the authors.

Contact: mywyb2{at}cam.ac.uk

* To whom correspondence should be addressed at: Trinity College, University of Cambridge, Cambridge CB2 1TQ, UK.


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
BioinformaticsHome page
K. Kojima, M. Nagasaki, and S. Miyano
Fast grid layout algorithm for biological networks with sweep calculation
Bioinformatics, June 15, 2008; 24(12): 1433 - 1441.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C. Klukas and F. Schreiber
Dynamic exploration and editing of KEGG pathway diagrams
Bioinformatics, February 1, 2007; 23(3): 344 - 350.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Y. Yang, L. Engin, E. S. Wurtele, C. Cruz-Neira, and J. A. Dickerson
Integration of metabolic networks and gene expression in virtual reality
Bioinformatics, September 15, 2005; 21(18): 3645 - 3650.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
W. Li and H. Kurata
A grid layout algorithm for automatic drawing of biochemical networks
Bioinformatics, May 1, 2005; 21(9): 2036 - 2042.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Holford, N. Li, P. Nadkarni, and H. Zhao
VitaPad: visualization tools for the analysis of pathway data
Bioinformatics, April 15, 2005; 21(8): 1596 - 1602.
[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.