CPL: Detecting Protein Complexes by Propagating Labels on Protein-Protein Interaction Network

被引:2
作者
Dai, Qi-Guo [1 ]
Guo, Mao-Zu [1 ]
Liu, Xiao-Yan [1 ]
Teng, Zhi-Xia [1 ,2 ]
Wang, Chun-Yu [1 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China
[2] Northeast Forestry Univ, Sch Informat & Comp Engn, Harbin 150040, Peoples R China
基金
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词
protein complex detection; label propagation; protein-protein interaction; graph clustering; bioinformatics; PPI NETWORKS; FUNCTIONAL MODULES; ALGORITHM; IDENTIFICATION; ANNOTATION; PREDICTION; SCALE; YEAST;
D O I
10.1007/s11390-014-1492-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Proteins usually bind together to form complexes, which play an important role in cellular activities. Many graph clustering methods have been proposed to identify protein complexes by finding dense regions in protein-protein interaction networks. We present a novel framework (CPL) that detects protein complexes by propagating labels through interactions in a network, in which labels denote complex identifiers. With proper propagation in CPL, proteins in the same complex will be assigned with the same labels. CPL does not make any strong assumptions about the topological structures of the complexes, as in previous methods. The CPL algorithm is tested on several publicly available yeast protein-protein interaction networks and compared with several state-of-the-art methods. The results suggest that CPL performs better than the existing methods. An analysis of the functional homogeneity based on a gene ontology analysis shows that the detected complexes of CPL are highly biologically relevant.
引用
收藏
页码:1083 / 1093
页数:11
相关论文
共 34 条
[1]   CFinder:: locating cliques and overlapping modules in biological networks [J].
Adamcsek, B ;
Palla, G ;
Farkas, IJ ;
Derényi, I ;
Vicsek, T .
BIOINFORMATICS, 2006, 22 (08) :1021-1023
[2]   Development and implementation of an algorithm for detection of protein complexes in large interaction networks [J].
Altaf-Ul-Amin, Md ;
Shinbo, Yoko ;
Mihara, Kenji ;
Kurokawa, Ken ;
Kanaya, Shigehiko .
BMC BIOINFORMATICS, 2006, 7 (1)
[3]  
Anirban M, 2012, MOL BIOSYST, V8, P3036
[4]   An automated method for finding molecular complexes in large protein interaction networks [J].
Bader, GD ;
Hogue, CW .
BMC BIOINFORMATICS, 2003, 4 (1)
[5]   Multifunctional proteins revealed by overlapping clustering in protein interaction network [J].
Becker, Emmanuelle ;
Robisson, Benoit ;
Chapple, Charles E. ;
Guenoche, Alain ;
Brun, Christine .
BIOINFORMATICS, 2012, 28 (01) :84-90
[6]   The Protein Data Bank [J].
Berman, HM ;
Westbrook, J ;
Feng, Z ;
Gilliland, G ;
Bhat, TN ;
Weissig, H ;
Shindyalov, IN ;
Bourne, PE .
NUCLEIC ACIDS RESEARCH, 2000, 28 (01) :235-242
[7]   GO::TermFinder - open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes [J].
Boyle, EI ;
Weng, SA ;
Gollub, J ;
Jin, H ;
Botstein, D ;
Cherry, JM ;
Sherlock, G .
BIOINFORMATICS, 2004, 20 (18) :3710-3715
[8]   Identifying protein complexes and functional modules-from static PPI networks to dynamic PPI networks [J].
Chen, Bolin ;
Fan, Weiwei ;
Liu, Juan ;
Wu, Fang-Xiang .
BRIEFINGS IN BIOINFORMATICS, 2014, 15 (02) :177-194
[9]   Identifying protein complexes in protein-protein interaction networks by using clique seeds and graph entropy [J].
Chen, Bolin ;
Shi, Jinhong ;
Zhang, Shenggui ;
Wu, Fang-Xiang .
PROTEOMICS, 2013, 13 (02) :269-277
[10]  
Eileen M H, 2013, P 9 INT C INN INF TE, P233