Cited by 23Bioinformatics and Genomic NetworksComplex Network Analysis TechniquesGene Regulatory Network Analysis

Denoising Protein–Protein interaction network via variational graph auto-encoder for protein complex detection

Yao, Heng, Guan, Jihong, Liu, Tianying·2020·Journal of Bioinformatics and Computational Biology

Abstract

Identifying protein complexes is an important issue in computational biology, as it benefits the understanding of cellular functions and the design of drugs. In the past decades, many computational methods have been proposed by mining dense subgraphs in Protein–Protein Interaction Networks (PINs). However, the high rate of false positive/negative interactions in PINs prevents accurately detecting complexes directly from the raw PINs. In this paper, we propose a denoising approach for protein complex detection by using variational graph auto-encoder. First, we embed a PIN to vector space by a stacked graph convolutional network (GCN), then decide which interactions in the PIN are credible. If the probability of an interaction being credible is less than a threshold, we delete the interaction. In such a way, we reconstruct a reliable PIN. Following that, we detect protein complexes in the reconstructed PIN by using several typical detection methods, including CPM, Coach, DPClus, GraphEntropy, IPCA and MCODE, and compare the results with those obtained directly from the original PIN. We conduct the empirical evaluation on four yeast PPI datasets (Gavin, Krogan, DIP and Wiphi) and two human PPI datasets (Reactome and Reactomekb), against two yeast complex benchmarks (CYC2008 and MIPS) and three human complex benchmarks (REACT, REACT_uniprotkb and CORE_COMPLEX_human), respectively. Experimental results show that with the reconstructed PINs obtained by our denoising approach, complex detection performance can get obviously boosted, in most cases by over 5%, sometimes even by 200%. Furthermore, we compare our approach with two existing denoising methods (RWS and RedNemo) while varying different matching rates on separate complex distributions. Our results show that in most cases (over 2/3), the proposed approach outperforms the existing methods.

Integrity signals

Registry

Crossref · 10.1142/s0219720020400107

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Due to experimental and resource constraints, the most current PPI networks remain limited in the number of protein nodes and physical interaction edges.

    “Due to experimental and resource constraints, the most updated PPI networks are still limited in their number of nodes (proteins) and edges (physical interactions) [118].”

    From Graph representation learning in biomedicine and healthcare (2022) · cites this paper as [118]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yao, H., Guan, J., & Liu, T.
Affiliations
Tongji University (CN)
Corresponding author
Guan, Jihong
Venue
Journal of Bioinformatics and Computational Biology
Published
2020-06
Volume
18
Issue
03
Pages
2040010
ISSN
  • 0219-7200 (ISSN-L)
  • 1757-6334
OpenAlex
W3033143713
Cited by
23
References
43
Citations by year
2025: 4 · 2024: 1 · 2023: 4 · 2022: 7 · 2021: 5 · 2020: 2
FWCI
1.46
Type
journal article
Language
en
Open access
closed
Locations
  • Journal of Bioinformatics and Computational Biology (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (61772367)
  • Shanghai Municipal Commission of Economy and Informatization (18XI-05)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
Keywords
protein-protein interaction network, protein complex detection, false positive interactions, network inference, dense subgraph mining, yeast interactome, human interactome
MeSH terms
Computer Graphics, Humans, Probability, Saccharomyces cerevisiae, Databases, Factual, Computational Biology, Protein Interaction Mapping, Protein Interaction Maps

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review