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.
- 6.Eades, P., Feng, Q., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 113–128. Springer, Heidelberg (1997)Google Scholar
- 11.Karp, P.D., Paley, S.: Automated drawing of metabolic pathways. In: Third International Conference on Bioinformatics and Genome Research, Tallahassee, Florida, June 1994, pp. 225–238 (1994)Google Scholar
- 12.Sander, G.: Layout of compound directed graphs. Technical Report A/03/96, University of Saarlandes, CS Dept., Saarbrücken, Germany (1996)Google Scholar
- 13.Schreiber, F.: High quality visualization of biochemical pathways in BioPath. Silico Biology 2(2), 59–73 (2002)Google Scholar