Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Han, K.
Right arrow Articles by Ju, B.-H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Han, K.
Right arrow Articles by Ju, B.-H.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 15 2003
pages 1882-1888
© 2003 Oxford University Press

A fast layout algorithm for protein interaction networks

Kyungsook Han * and Byong-Hyon Ju

School of Computer Science & Engineering, Inha University, Inchon 402-751, Korea

Received on May 1, 2003 ; revised on July 15, 2003 ; accepted on July 15, 2003

Motivation: Graph drawing algorithms are often used for visualizing relational information, but a naive implementation of a graph drawing algorithm encounters real difficulties when drawing large-scale graphs such as protein interaction networks.

Results: We have developed a new, extremely fast layout algorithm for visualizing large-scale protein interaction networks in the three-dimensional space. The algorithm (1) first finds a layout of connected components of an entire network, (2) finds a global layout of nodes with respect to pivot nodes within a connected component and (3) refines the local layout of each connected component by first relocating midnodes with respect to their cutvertices and direct neighbors of the cutvertices and then by relocating all nodes with respect to their neighbors within distance 2. Advantages of this algorithm over classical graph drawing methods include: (1) it is an order of magnitude faster, (2) it can directly visualize data from protein interaction databases and (3) it provides several abstraction and comparison operations for effectively analyzing large-scale protein interaction networks.

Availability: http://wilab.inha.ac.kr/interviewer/

Contact: khan{at}inha.ac.kr

* To whom correspondence should be addressed


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
W. Li and H. Kurata
A grid layout algorithm for automatic drawing of biochemical networks
Bioinformatics, May 1, 2005; 21(9): 2036 - 2042.
[Abstract] [Full Text] [PDF]


Home page
Mol. Cell. ProteomicsHome page
E. Paek, J. Park, and K.-J. Lee
Multi-layered Representation for Cell Signaling Pathways
Mol. Cell. Proteomics, October 1, 2004; 3(10): 1009 - 1022.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
H. Lu, X. Zhu, H. Liu, G. Skogerbo, J. Zhang, Y. Zhang, L. Cai, Y. Zhao, S. Sun, J. Xu, et al.
The interactome as a tree--an attempt to visualize the protein-protein interaction network in yeast
Nucleic Acids Res., September 8, 2004; 32(16): 4804 - 4811.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
K. Han, B.-H. Ju, and H. Jung
WebInterViewer: visualizing and analyzing molecular interaction networks
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W89 - W95.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.