title: Identifying protein complexes by reducing noise in interaction networks.
abstract: Identifying protein complexes in protein-protein interaction (PPI) networks is a fundamental problem in computational biology. High-throughput experimental techniques have generated large, experimentally detected PPI datasets. These interactions represent a rich source of data that can be used to detect protein complexes; however, such interactions contain much noise. Therefore, these interactions should be validated before they could be applied to detect protein complexes. We propose an efficient measure to estimate PPI reliability (PPIR) and reduce noise level in two different yeast PPI networks. PPIRU, which is a new protein complex clustering algorithm based on PPIR, is introduced. Experiments demonstrated that interactome graph weighting methods incorporating PPIR clearly improve the results of several clustering algorithms. PPIR also outperforms other PPI graph weighting schemes in most cases. We compare PPIRU with several efficient, existing clustering algorithms and reveal that the accuracy values of PPIRU clusters are much higher than those of other algorithms.
authors.forename: Bo
authors.initials: B
authors.lastname: Liao
authors.forename: Xiangzheng
authors.initials: X
authors.lastname: Fu
authors.forename: Lijun
authors.initials: L
authors.lastname: Cai
authors.affiliation: College of Information Science and Engineering, Hunan University, Changsha, Hunan, 410082, China. dragonbw@163.com.
authors.forename: Haowen
authors.initials: H
authors.lastname: Chen
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D030562:Databases, Protein; D025941:Protein Interaction Mapping / Q000379:methods*; D011506:Proteins / Q000737:chemistry* / Q000378:metabolism; D040901:Proteomics / Q000379:methods
chemical_list: D011506:Proteins