By Topic

Identifying Protein Complexes from PPI Networks Using GO Semantic Similarity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Jian Wang ; Sch. of Comput. Sci. & Technol., Dalian Univ. of Technol., Dalian, China ; Dong Xie ; Hongfei Lin ; Zhihao Yang
more authors

Protein complexes play a key role in many biological processes. Various computational approaches have been developed to identify complexes from protein-protein interaction (PPI) networks. However, high false-positive rate of PPIs makes the identification challenging. In this paper, we propose a protein semantic similarity measure based on the ontology structure of Gene Ontology (GO) terms and GO annotations to estimate the reliability of interactions in PPI networks. Interaction pairs with low GO semantic similarity are removed from the network as unreliable interactions. Then, a cluster-expanding algorithm is applied to identify complexes with core-attachment structure on the filtered network. We have applied our method on three different yeast PPI networks. The effectiveness of our method is examined on two benchmark complex datasets. Experimental results show that our method outperforms other state-of-the-art approaches in most evaluation metrics. Removing interactions with low similarity significantly improves the performance of complex identification.

Published in:

Bioinformatics and Biomedicine (BIBM), 2011 IEEE International Conference on

Date of Conference:

12-15 Nov. 2011