Bioinformatics Advance Access originally published online on January 27, 2005
Bioinformatics 2005 21(9):2036-2042; doi:10.1093/bioinformatics/bti290
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
A grid layout algorithm for automatic drawing of biochemical networks
Department of Bioscience and Bioinformatics, Kyushu Institute of Technology 680-4 Kawazu, Iizuka, Fukuoka 820-8502, Japan
*To whom correspondence should be addressed.
Motivation: Visualization is indispensable in the research of complex biochemical networks. Available graph layout algorithms are not adequate for satisfactorily drawing such networks. New methods are required to visualize automatically the topological architectures and facilitate the understanding of the functions of the networks.
Results: We propose a novel layout algorithm to draw complex biochemical networks. A network is modeled as a system of interacting nodes on squared grids. A discrete cost function between each node pair is designed based on the topological relation and the geometric positions of the two nodes. The layouts are produced by minimizing the total cost. We design a fast algorithm to minimize the discrete cost function, by which candidate layouts can be produced efficiently. A simulated annealing procedure is used to choose better candidates. Our algorithm demonstrates its ability to exhibit cluster structures clearly in relatively compact layout areas without any prior knowledge. We developed Windows software to implement the algorithm for CADLIVE.
Availability: All materials can be freely downloaded from http://kurata21.bio.kyutech.ac.jp/grid/grid_layout.htm; http://www.cadlive.jp/
Contact: kurata{at}bio.kyutech.ac.jp
Supplementary information: http://kurata21.bio.kyutech.ac.jp/grid/grid_layout.htm; http://www.cadlive.jp/
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
K. Kojima, M. Nagasaki, and S. Miyano Fast grid layout algorithm for biological networks with sweep calculation Bioinformatics, June 15, 2008; 24(12): 1433 - 1441. [Abstract] [Full Text] [PDF] |
||||
![]() |
H. Kurata, K. Inoue, K. Maeda, K. Masaki, Y. Shimokawa, and Q. Zhao Extended CADLIVE: a novel graphical notation for design of biochemical network maps and computational pathway analysis Nucleic Acids Res., November 29, 2007; 35(20): e134 - e134. [Abstract] [Full Text] [PDF] |
||||
![]() |
M. Suderman and M. Hallett Tools for visually exploring biological networks Bioinformatics, October 15, 2007; 23(20): 2651 - 2659. [Abstract] [Full Text] [PDF] |
||||
![]() |
A. Barsky, J. L. Gardy, R. E. W. Hancock, and T. Munzner Cerebral: a Cytoscape plugin for layout of and interaction with biological networks using subcellular localization annotation Bioinformatics, April 15, 2007; 23(8): 1040 - 1042. [Abstract] [Full Text] [PDF] |
||||
![]() |
T. Aittokallio and B. Schwikowski Graph-based methods for analysing networks in cell biology Brief Bioinform, September 1, 2006; 7(3): 243 - 255. [Abstract] [Full Text] [PDF] |
||||


