Efficient Modularization of Weighted Protein Interaction Networks using k-Hop Graph Reduction

  • Authors:
  • Young-Rae Cho;Woochang Hwang;Aidong Zhang

  • Affiliations:
  • State University of New York at Buffalo;State University of New York at Buffalo;State University of New York at Buffalo

  • Venue:
  • BIBE '06 Proceedings of the Sixth IEEE Symposium on BionInformatics and BioEngineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.