Computational approaches for detecting protein complexes from protein interaction networks: a survey

被引:226
作者
Li, Xiaoli [1 ]
Wu, Min [2 ]
Kwoh, Chee-Keong [2 ]
Ng, See-Kiong [1 ]
机构
[1] Inst Infocomm Res, Singapore, Singapore
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore, Singapore
来源
BMC GENOMICS | 2010年 / 11卷
关键词
FUNCTIONAL MODULES; SEMANTIC SIMILARITY; PHYSICAL INTERACTOME; YEAST; ALGORITHM; INTEGRATION; ANNOTATION; PREDICTION; MODULARITY; TOPOLOGY;
D O I
10.1186/1471-2164-11-S1-S3
中图分类号
Q81 [生物工程学(生物技术)]; Q93 [微生物学];
学科分类号
071005 ; 0836 ; 090102 ; 100705 ;
摘要
Background: Most proteins form macromolecular complexes to perform their biological functions. However, experimentally determined protein complex data, especially of those involving more than two protein partners, are relatively limited in the current state-of-the-art high-throughput experimental techniques. Nevertheless, many techniques (such as yeast-two-hybrid) have enabled systematic screening of pairwise protein-protein interactions en masse. Thus computational approaches for detecting protein complexes from protein interaction data are useful complements to the limited experimental methods. They can be used together with the experimental methods for mapping the interactions of proteins to understand how different proteins are organized into higher-level substructures to perform various cellular functions. Results: Given the abundance of pairwise protein interaction data from high-throughput genome-wide experimental screenings, a protein interaction network can be constructed from protein interaction data by considering individual proteins as the nodes, and the existence of a physical interaction between a pair of proteins as a link. This binary protein interaction graph can then be used for detecting protein complexes using graph clustering techniques. In this paper, we review and evaluate the state-of-the-art techniques for computational detection of protein complexes, and discuss some promising research directions in this field. Conclusions: Experimental results with yeast protein interaction data show that the interaction subgraphs discovered by various computational methods matched well with actual protein complexes. In addition, the computational approaches have also improved in performance over the years. Further improvements could be achieved if the quality of the underlying protein interaction data can be considered adequately to minimize the undesirable effects from the irrelevant and noisy sources, and the various biological evidences can be better incorporated into the detection process to maximize the exploitation of the increasing wealth of biological knowledge available.
引用
收藏
页数:19
相关论文
共 106 条
  • [1] A graph isomorphism algorithm for object recognition
    Abdulrahim, MA
    Misra, M
    [J]. PATTERN ANALYSIS AND APPLICATIONS, 1998, 1 (03) : 189 - 201
  • [2] CFinder:: locating cliques and overlapping modules in biological networks
    Adamcsek, B
    Palla, G
    Farkas, IJ
    Derényi, I
    Vicsek, T
    [J]. BIOINFORMATICS, 2006, 22 (08) : 1021 - 1023
  • [3] The cell as a collection of protein machines: Preparing the next generation of molecular biologists
    Alberts, B
    [J]. CELL, 1998, 92 (03) : 291 - 294
  • [4] Understanding Modularity in Molecular Networks Requires Dynamics
    Alexander, Roger P.
    Kim, Philip M.
    Emonet, Thierry
    Gerstein, Mark B.
    [J]. SCIENCE SIGNALING, 2009, 2 (81) : pe44
  • [5] COLOR-CODING
    ALON, N
    YUSTER, R
    ZWICK, U
    [J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (04): : 844 - 856
  • [6] Structure-based assembly of protein complexes in yeast
    Aloy, P
    Böttcher, B
    Ceulemans, H
    Leutwein, C
    Mellwig, C
    Fischer, S
    Gavin, AC
    Bork, P
    Superti-Furga, G
    Serrano, L
    Russell, RB
    [J]. SCIENCE, 2004, 303 (5666) : 2026 - 2029
  • [7] Development and implementation of an algorithm for detection of protein complexes in large interaction networks
    Altaf-Ul-Amin, Md
    Shinbo, Yoko
    Mihara, Kenji
    Kurokawa, Ken
    Kanaya, Shigehiko
    [J]. BMC BIOINFORMATICS, 2006, 7 (1)
  • [8] [Anonymous], 1999, COMPLEXITY APPROXIMA, DOI DOI 10.1007/978-3-642-58412-1
  • [9] [Anonymous], 2008, P ACM INT C MAN DAT, DOI DOI 10.1145/1376616.1376661
  • [10] [Anonymous], 2000, A cluster algorithm for graphs, DOI DOI 10.1016/J.COSREV.2007.05.001