How and when should interactome-derived clusters be used to predict functional modules and protein function?

被引:96
作者
Song, Jimin
Singh, Mona [1 ]
机构
[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
INTERACTION NETWORKS; GENETIC INTERACTIONS; COMPLEXES; ORGANIZATION; ALGORITHMS;
D O I
10.1093/bioinformatics/btp551
中图分类号
Q5 [生物化学];
学科分类号
070307 [化学生物学];
摘要
Motivation: Clustering of protein-protein interaction networks is one of the most common approaches for predicting functional modules, protein complexes and protein functions. But, how well does clustering perform at these tasks? Results: We develop a general framework to assess how well computationally derived clusters in physical interactomes overlap functional modules derived via the Gene Ontology (GO). Using this framework, we evaluate six diverse network clustering algorithms using Saccharomyces cerevisiae and show that (i) the performances of these algorithms can differ substantially when run on the same network and (ii) their relative performances change depending upon the topological characteristics of the network under consideration. For the specific task of function prediction in S.cerevisiae, we demonstrate that, surprisingly, a simple non-clustering guilt-by-association approach outperforms widely used clustering-based approaches that annotate a protein with the overrepresented biological process and cellular component terms in its cluster; this is true over the range of clustering algorithms considered. Further analysis parameterizes performance based on the number of annotated proteins, and suggests when clustering approaches should be used for interactome functional analyses. Overall our results suggest a re-examination of when and how clustering approaches should be applied to physical interactomes, and establishes guidelines by which novel clustering approaches for biological networks should be justified and evaluated with respect to functional analysis.
引用
收藏
页码:3143 / 3150
页数:8
相关论文
共 40 条
[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]
Iterative cluster analysis of protein interaction data [J].
Arnau, V ;
Mars, S ;
Marín, I .
BIOINFORMATICS, 2005, 21 (03) :364-378
[4]
Gene Ontology: tool for the unification of biology [J].
Ashburner, M ;
Ball, CA ;
Blake, JA ;
Botstein, D ;
Butler, H ;
Cherry, JM ;
Davis, AP ;
Dolinski, K ;
Dwight, SS ;
Eppig, JT ;
Harris, MA ;
Hill, DP ;
Issel-Tarver, L ;
Kasarskis, A ;
Lewis, S ;
Matese, JC ;
Richardson, JE ;
Ringwald, M ;
Rubin, GM ;
Sherlock, G .
NATURE GENETICS, 2000, 25 (01) :25-29
[5]
Predicting protein complex membership using probabilistic network reliability [J].
Asthana, S ;
King, OD ;
Gibbons, FD ;
Roth, FP .
GENOME RESEARCH, 2004, 14 (06) :1170-1175
[6]
An automated method for finding molecular complexes in large protein interaction networks [J].
Bader, GD ;
Hogue, CW .
BMC BIOINFORMATICS, 2003, 4 (1)
[7]
Network biology:: Understanding the cell's functional organization [J].
Barabási, AL ;
Oltvai, ZN .
NATURE REVIEWS GENETICS, 2004, 5 (02) :101-U15
[8]
Exploring genetic interactions and networks with yeast [J].
Boone, Charles ;
Bussey, Howard ;
Andrews, Brenda J. .
NATURE REVIEWS GENETICS, 2007, 8 (06) :437-449
[9]
Fault Tolerance in Protein Interaction Networks: Stable Bipartite Subgraphs and Redundant Pathways [J].
Brady, Arthur ;
Maxwell, Kyle ;
Daniels, Noah ;
Cowen, Lenore J. .
PLOS ONE, 2009, 4 (04)
[10]
Evaluation of clustering algorithms for protein-protein interaction networks [J].
Brohee, Sylvain ;
van Helden, Jacques .
BMC BIOINFORMATICS, 2006, 7 (1)