Efficient Modularization of Weighted Protein Interaction Networks using k-Hop Graph Reduction
Young-Rae Cho
Woochang Hwang
Aidong Zhang
Dept. of Comput. Sci. & Eng., State Univ. of New York;
This paper appears in: BioInformatics and BioEngineering, 2006. BIBE 2006. Sixth IEEE Symposium on
Publication Date: 16-18 Oct. 2006
On page(s): 289-298
Location: Arlington, VA,
ISBN: 0-7695-2727-2
INSPEC Accession Number: 9287390
Digital Object Identifier: 10.1109/BIBE.2006.253347
Current Version Published: 2006-12-04
Abstract
Recent computational analyses of protein interaction networks have attempted to understand cellular organizations, processes and functions. Several topology-based clustering methods have been applied to the protein interaction networks for detecting functional modules. However, most of the previous algorithms do not perform well on small-world, scale-free networks. In this paper, we present an efficient approach to identify hierarchical modules in the protein interaction networks. Our algorithm selects a small number of informative proteins from a large network, and transforms the intricate small-world, scale-free network into a simple graph with high modularity. Our results show that this approach remarkably enhances the efficiency. We also demonstrate that it outperforms other previous methods in terms of accuracy
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
