Clustered Graph Hierarchical Layout Algorithm for Systems Biology Models

International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 24
Year of Publication: 2014
Pratik Erande
Noshir Tarapore
Vrushali Inamdar

Pratik Erande, Noshir Tarapore and Vrushali Inamdar. Article: Clustered Graph Hierarchical Layout Algorithm for Systems Biology Models. International Journal of Computer Applications 96(24):28-35, June 2014. Full text available. BibTeX

	author = {Pratik Erande and Noshir Tarapore and Vrushali Inamdar},
	title = {Article: Clustered Graph Hierarchical Layout Algorithm for Systems Biology Models},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {24},
	pages = {28-35},
	month = {June},
	note = {Full text available}


In this article we describe a complete method to the layout clustered graph in hierarchical fashion. We have adopted Sugiyama[11] framework for hierarchical layout and modified its phases to produce the clustered graph layout. The algorithm is based on Sanders compound graph layout algorithm. Our main contribution is positioning of nodes with different sizes without any node overlap while maintaining straight lines for long edges. Experimental results show that the executiontime and quality of the produced drawings with respect to commonly accepted layoutcriteria are quite satisfactory. This algorithm is intended to integrate as a part of system biology software Cell-in-Silico, for drawing biological pathways with compartmental constraints and arbitrary nesting of graphs and molecular complexes.


  • Ulrik Brandes and Boris Kopf, 2002. "Fast and Simple Horizontal Coordinate Assignment". 9th international symposium on Graph Drawing(GD'01) (LNCS 2265), 31-44.
  • Peter Eades, Xuemin Lin, and Roberto Tamassia, 1996. "An Algorithm for Drawing a Hierarchical Graph". International Journal of Computational Geometry & Applications, 6:145-156.
  • Peter Eades and Kozo Sugiyama, 1990. "How to Draw a Directed Graph". Journal of Information Processing, 13(4), 424-437.
  • Michael Frohlich and Mattias Werner, 1994. "The graph visualization system daVinci - a user interface for applications". Technical Report 5/94, Department of Computer Science, University of Bremen.
  • Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, and Kiem-Phong Vo. ,1993. "A Technique for Drawing Directed Graphs". IEEE Transactions on Software Engineering, 19(3):214-230.
  • Emden R. Gansner, Stephen C. North, and Kiem-Phong Vo. , 1988. "DAG - A Program that Draws Directed Graphs". Software - Practice and Experience, 17(1):1047-1062.
  • Georg Sander, 1995. "Graph Layout through the VCG Tool". In Roberto Tamassia and Ioannis G. Tollis, editor, Proceedings of the DIMACSInternational Workshop on Graph Drawing (GD '94), LNCS 894, 194-205, Springer.
  • Georg Sander, 1996. "A fast heuristic for hierarchical Manhattan layout". In Franz J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD '95), LNCS 1027, 447-458. Springer.
  • Georg Sander, 1999. "Graph Layout for Applications in Compiler Construction". Theoretical Computer Science, 217(2):175-214.
  • Kozo Sugiyama and Kazuo Misue, 1991. "Visualization of Structural Information: Automatic Drawing of Compound Digraphs". IEEE Transactions on Systems, Man and Cybernetics, 21(4):876–892.
  • Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda, 1981. "Methods for Visual Understanding of Hierarchical System Structures". IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125.
  • Georg Sander, 1996. "Layout of Compound Directed Graphs". Technical Report A/03/96. Sarland University, D-66123 Saarbrücken, Germany.
  • Christoph Buchheim, Michael Jünger, and Sebastian Leipert, 2001. "A Fast Layout Algorithm for K-Level Graphs". In Joe Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), LNCS 1984, 229–240, Springer.
  • Cell Designer Guide, available online at: http://celldesigner. org/documents/StartupGuide42. pdf.