Please use this identifier to cite or link to this item: https://doi.org/10.1186/1477-5956-9-S1-S15
Title: Decomposing PPI networks for complex discovery
Authors: Liu, G. 
Yong, C.H.
Chua, H.N.
Wong, L. 
Issue Date: 2011
Source: Liu, G.,Yong, C.H.,Chua, H.N.,Wong, L. (2011). Decomposing PPI networks for complex discovery. Proteome Science 9 (SUPPL. 1). ScholarBank@NUS Repository. https://doi.org/10.1186/1477-5956-9-S1-S15
Abstract: Background: Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput protein-protein interactions (PPI), many algorithms have been proposed to discover protein complexes from PPI networks. However, existing algorithms generally do not take into consideration the fact that not all the interactions in a PPI network take place at the same time. As a result, predicted complexes often contain many spuriously included proteins, precluding them from matching true complexes.Results: We propose two methods to tackle this problem: (1) The localization GO term decomposition method: We utilize cellular component Gene Ontology (GO) terms to decompose PPI networks into several smaller networks such that the proteins in each decomposed network are annotated with the same cellular component GO term. (2) The hub removal method: This method is based on the observation that hub proteins are more likely to fuse clusters that correspond to different complexes. To avoid this, we remove hub proteins from PPI networks, and then apply a complex discovery algorithm on the remaining PPI network. The removed hub proteins are added back to the generated clusters afterwards. We tested the two methods on the yeast PPI network downloaded from BioGRID. Our results show that these methods can improve the performance of several complex discovery algorithms significantly. Further improvement in performance is achieved when we apply them in tandem.Conclusions: The performance of complex discovery algorithms is hindered by the fact that not all the interactions in a PPI network take place at the same time. We tackle this problem by using localization GO terms or hubs to decompose a PPI network before complex discovery, which achieves considerable improvement. © 2011 Liu et al; licensee BioMed Central Ltd.
Source Title: Proteome Science
URI: http://scholarbank.nus.edu.sg/handle/10635/39588
ISSN: 14775956
DOI: 10.1186/1477-5956-9-S1-S15
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
2011-decomposing_ppi_networks_complex-published.pdf716.72 kBAdobe PDF

OPEN

PublishedView/Download

SCOPUSTM   
Citations

8
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

4
checked on Nov 6, 2017

Page view(s)

58
checked on Dec 16, 2017

Download(s)

2
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.