Protein complex prediction via dense subgraphs and false positive analysis

被引:9
|
作者
Hernandez, Cecilia [1 ,2 ]
Mella, Carlos [1 ]
Navarro, Gonzalo [2 ]
Olivera-Nappa, Alvaro [3 ]
Araya, Jaime [1 ]
机构
[1] Univ Concepcion, Comp Sci, Concepcion, Chile
[2] Univ Chile, Ctr Biotechnol & Bioengn CeBiB, Dept Comp Sci, Santiago, Chile
[3] Univ Chile, Ctr Biotechnol & Bioengn CeBiB, Dept Chem Engn & Biotechnol, Santiago, Chile
来源
PLOS ONE | 2017年 / 12卷 / 09期
关键词
INTERACTION NETWORKS; SACCHAROMYCES-CEREVISIAE; BIOLOGICAL NETWORKS; IDENTIFICATION; DATABASE; YEAST; INTERACTOME; CLIQUES;
D O I
10.1371/journal.pone.0183460
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Many proteins work together with others in groups called complexes in order to achieve a specific function. Discovering protein complexes is important for understanding biological processes and predict protein functions in living organisms. Large-scale and throughput techniques have made possible to compile protein-protein interaction networks (PPI networks), which have been used in several computational approaches for detecting protein complexes. Those predictions might guide future biologic experimental research. Some approaches are topology-based, where highly connected proteins are predicted to be complexes; some propose different clustering algorithms using partitioning, overlaps among clusters for networks modeled with unweighted or weighted graphs; and others use density of clusters and information based on protein functionality. However, some schemes still require much processing time or the quality of their results can be improved. Furthermore, most of the results obtained with computational tools are not accompanied by an analysis of false positives. We propose an effective and efficient mining algorithm for discovering highly connected subgraphs, which is our base for defining protein complexes. Our representation is based on transforming the PPI network into a directed acyclic graph that reduces the number of represented edges and the search space for discovering subgraphs. Our approach considers weighted and unweighted PPI networks. We compare our best alternative using PPI networks from Saccharomyces cerevisiae (yeast) and Homo sapiens (human) with state-of-the-art approaches in terms of clustering, biological metrics and execution times, as well as three gold standards for yeast and two for human. Furthermore, we analyze false positive predicted complexes searching the PDBe (Protein Data Bank in Europe) database in order to identify matching protein complexes that have been purified and structurally characterized. Our analysis shows that more than 50 yeast protein complexes and more than 300 human protein complexes found to be false positives according to our prediction method, i. e., not described in the gold standard complex databases, in fact contain protein complexes that have been characterized structurally and documented in PDBe. We also found that some of these protein complexes have recently been classified as part of a Periodic Table of Protein Complexes.
引用
收藏
页数:37
相关论文
共 50 条
  • [1] SRDF: Single-Stage Rotate Object Detector via Dense Prediction and False Positive Suppression
    Song, Beihang
    Li, Jing
    Wu, Jia
    Du, Bo
    Chang, Jun
    Wan, Jun
    Liu, Tianpeng
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2023, 61
  • [2] Protein complex prediction based on k-connected subgraphs in protein interaction network
    Habibi, Mahnaz
    Eslahchi, Changiz
    Wong, Limsoon
    BMC SYSTEMS BIOLOGY, 2010, 4
  • [3] Dense Temporal Subgraphs in Protein-Protein Interaction Networks
    Dondi, Riccardo
    Hosseinzadeh, Mohammad Mehdi
    Zoppis, Italo
    COMPUTATIONAL SCIENCE, ICCS 2022, PT II, 2022, : 469 - 480
  • [4] Everywhere-Sparse Spanners via Dense Subgraphs
    Chlamtac, Eden
    Dinitz, Michael
    Krauthgamer, Robert
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 758 - 767
  • [5] Energy Centrality Relationship Reduces False Positive Prediction in Protein Docking
    Sudarshan, Sanjana
    Beck, Brian W.
    BIOPHYSICAL JOURNAL, 2013, 104 (02) : 390A - 390A
  • [6] Compressed Representation of Web and Social Networks via Dense Subgraphs
    Hernandez, Cecilia
    Navarro, Gonzalo
    STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 264 - 276
  • [7] Detecting Cash-out Users via Dense Subgraphs
    Ji, Yingsheng
    Zhang, Zheng
    Tang, Xinlei
    Shen, Jiachen
    Zhang, Xi
    Yang, Guangwen
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 687 - 697
  • [8] Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers
    Fazzone, Adriano
    Lanciano, Tommaso
    Denni, Riccardo
    Tsourakakis, Charalampos E.
    Bonchi, Francesco
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (13): : 3883 - 3896
  • [9] Mining Dense Overlapping Subgraphs in weighted protein-protein interaction networks
    Lee, Anthony J. T.
    Lin, Ming-Chih
    Hsu, Chia-Ming
    BIOSYSTEMS, 2011, 103 (03) : 392 - 399
  • [10] Detecting Dense Subgraphs in Complex Networks Based on Edge Density Coefficient
    Guan Bo
    Zan Xiangzhen
    Xiao Biyu
    Ma Runnian
    Zhang Fengyue
    Liu Wenbin
    CHINESE JOURNAL OF ELECTRONICS, 2013, 22 (03): : 517 - 520