A Compound Graph Layout Algorithm for Biological Pathways

We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented within Patika, a pathway analysis tool for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and pathway abstractions. Experimental results show that execution times and quality of the produced drawings with respect to commonly accepted layout criteria and pathway drawing conventions are quite satisfactory.

[1]  Toshihisa Takagi,et al.  Knowledge representation of signal transduction pathways , 2001, Bioinform..

[2]  Georg Sander,et al.  Layout of compound directed graphs , 1996 .

[3]  Falk Schreiber,et al.  High quality visualization of biochemical pathways in BioPath , 2002, Silico Biol..

[4]  Emek Demir,et al.  An ontology for collaborative construction and analysis of cellular pathways , 2004, Bioinform..

[5]  Ugur Dogrusöz,et al.  A Constrained, Force-Directed Layout Algorithm for Biological Pathways , 2003, Graph Drawing.

[6]  Peter D. Karp,et al.  Automated Drawing of Metabolic Pathways , 2000 .

[7]  Kozo Sugiyama,et al.  A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR , 1995, Graph Drawing.

[8]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[9]  Kozo Sugiyama,et al.  Visualization of structural information: automatic drawing of compound digraphs , 1991, IEEE Trans. Syst. Man Cybern..

[10]  Isabel Rojas,et al.  A graph layout algorithm for drawing metabolic pathways , 2001, Bioinform..

[11]  François Bertault.  A Force-Directed Algorithm that Preserves Edge Crossing Properties , 1999, Graph Drawing.

[12]  Emek Demir,et al.  PATIKA: an integrated visual environment for collaborative construction and analysis of cellular pathways , 2002, Bioinform..

[13]  François Bertault,et al.  A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..

[14]  Hiroshi Nagamochi,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.