Complexity management in visualizing protein interaction networks

被引:16
作者
Ju, Byong-Hyon [1 ]
Han, Kyungsook [1 ]
机构
[1] Inha Univ, Sch Comp Sci & Engn, Inchon 402751, South Korea
关键词
protein-protein interaction network; visualization; abstraction;
D O I
10.1093/bioinformatics/btg1022
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Protein-protein interaction networks often consist of thousands of nodes or more. This severely limits the utility of many graph drawing tools because they become too slow for an interactive analysis of the networks and because they produce cluttered drawings with many edge crossings. Results: A new layout algorithm with complexity management operations in visualizing a large-scale protein interaction network was developed and implemented in a program called InterViewer3. InterViewer3 simplifies a complex network by collapsing a group of nodes with the same interacting partners into a composite node and by replacing a clique with a star-shaped subgraph. The experimental results demonstrated that InterViewer3 is one order of magnitude faster than the other drawing programs and that its complexity management is successful.
引用
收藏
页码:i177 / i179
页数:3
相关论文
共 6 条
[1]  
Batagelj V, 2002, LECT NOTES COMPUT SC, V2265, P477
[2]   Reactive local search for the maximum clique problem [J].
Battiti, R ;
Protasi, M .
ALGORITHMICA, 2001, 29 (04) :610-637
[3]  
David A, 2002, LECT NOTES COMPUT SC, V2265, P435
[4]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[5]   Visualization and analysis of protein interactions [J].
Ju, BH ;
Park, B ;
Park, JH ;
Han, K .
BIOINFORMATICS, 2003, 19 (02) :317-318
[6]   AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS [J].
KAMADA, T ;
KAWAI, S .
INFORMATION PROCESSING LETTERS, 1989, 31 (01) :7-15