Loading…

A graph layout algorithm for drawing metabolic pathways

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 ch...

Full description

Saved in:
Bibliographic Details
Published in:Bioinformatics 2001-05, Vol.17 (5), p.461-467
Main Authors: Becker, Moritz Y., Rojas, Isabel
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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@cam.ac.uk * To whom correspondence should be addressed at: Trinity College, University of Cambridge, Cambridge CB2 1TQ, UK.
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/17.5.461