A Compound Graph Layout Algorithm for Biological Pathways

Dogrusoz, Ugur and Giral, Erhan and Cetintas, Ahmet and Civril, Ali and Demir, Emek (2004) A Compound Graph Layout Algorithm for Biological Pathways. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 442-447 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_45).

Full text not available from this repository.

Abstract

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.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_45
Classifications:M Methods > M.400 Force-directed / Energy-based
P Styles > P.240 Compound
ID Code:615

Repository Staff Only: item control page

References

M. Y. Becker and I. Rojas. A graph layout algorithm for drawing metabolic pathways. Bioinformatics, 17:461-467, 2001.

F. Bertault. Force-directed algorithm that preserves edge crossing properties. In J. Kratochvil, editor, GD '99, volume 1731 of Lecture Notes in Computer Science, pages 351-358. Springer- Verlag, 1999.

E. Dimir, O. Babur, U. Dogrusoz, A. Gursoy, A. Ayaz, G. Gulesir, G. Nisanci, and R. Cetin-Atalay. An ontology for collaborative construction and analysis of cellular pathways. Bioinformatics, 20(3):349-356, 2002.

E. Demir, O. Babur, U. Dogrusoz, A. Gursoy, G. Nisanci, R. Cetin-Atalay, and M. Ozturk. PATIKA: An integrated visual environment for collaborative construction and analysis of cellular pathways. Bioinformatics, 18(7):996-1003, 2002.

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing, Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.

P. Eades, Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, GD '96, volume 1190 of Lecture Notes in Computer Science, pages 113-128. Springer-Verlag, 1997.

T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software Practice and Experience, 21(11):1129-1164, 1991.

K. Fukuda and T. Takagi. Knowledge representation of signal transduction pathways. Bioinformatics, 17(9):829-837, 2001.

B. Genc and U. Dogrusoz. A constrained, force-directed layout algorithm for biological pathways. In G. Liotta, editor, GD '03, volume 2912 of LNCS, pages 349-356, 2003.

K. Sigiyama and K. Misue. A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR. In F. J. Brandenburg, editor, GD '95, volume 1027 of Lecture Notes in Computer Science, pages 500-503. Springer-Verlag, 1995.

P. D. Karp and S. Paley. Automated drawing of metabolic pathways. In Third International Conference on Bioinformatics and Genome Research, pages 225-238, Tallahassee, Florida, June 1994.

G. Sander. Layout of compound directed graphs. Technical Report A/03/96, University of Saarlandes, CS Dept., Saarbrücken, Germany, 1996.

F. Schreiber. High quality visualization of biochemical pathways in BioPath. In Silico Biology, 2(2):59-73, 2002.

K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876-892, 1991.