Evidence map›Paper›PMID 23235927›Full record

ArticleBioinformatics (Oxford, England)2013

A novel link prediction algorithm for reconstructing protein-protein interaction networks by topological similarity.

Chengwei Lei, Jianhua Ruan

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 38 papers.

0numbers the graph read from it
0cells of the map it votes in
38citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

38 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Bias-aware training and evaluation of link prediction algorithms in network biology.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  5. Article
  6. Article
  7. The importance of graph databases and graph learning for clinical applications.Database : the journal of biological databases and curation · 2023
    Review
  8. Article
  9. Article
  10. Article
  11. Article
  12. Review
  13. Article
  14. An In Silico Method for Predicting Drug Synergy Based on Multitask Learning.Interdisciplinary sciences, computational life sciences · 2021
    Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Chengwei LeiDepartment of Computer Science, The University of Texas at San Antonio, San Antonio, TX 78249, USA.
Jianhua Ruan

Funding

Predicting Drug Resistance in Cancer Genomes by DMA Methylation ProfilingU54CA113001 · NCI · UNIVERSITY OF TEXAS HLTH SCIENCE CENTER · PI HUANG, TIM H.-M. · 2004 to 2014
$16.1M
RCMI Center for Interdiscplinary Health Research CIHRG12MD007591 · NIMHD · UNIVERSITY OF TEXAS SAN ANTONIO · PI PERRY, GEORGE · 2012 to 2016
$10.4M
Improving etoposide treatment of Ewing's sarcomaR01CA152063 · NCI · UNIVERSITY OF TEXAS HLTH SCIENCE CENTER · PI BISHOP, ALEXANDER JAMES · 2011 to 2015
$1.5M
Computational Discovery and Analysis of Community Structures in Biology NetworksSC3GM086305 · NIGMS · UNIVERSITY OF TEXAS SAN ANTONIO · PI RUAN, JIANHUA · 2009 to 2012
$555k
NCI NIH HHS R01 CA152063NCI NIH HHS R01CA152063NCI NIH HHS U54 CA113001NCI NIH HHS U54CA113001NIGMS NIH HHS SC3 GM086305NIGMS NIH HHS SC3GM086305NIMHD NIH HHS G12 MD007591NIMHD NIH HHS G12MD007591
6 · The paper itself

Abstract

motivationRecent advances in technology have dramatically increased the availability of protein-protein interaction (PPI) data and stimulated the development of many methods for improving the systems level understanding the cell. However, those efforts have been significantly hindered by the high level of noise, sparseness and highly skewed degree distribution of PPI networks. Here, we present a novel algorithm to reduce the noise present in PPI networks. The key idea of our algorithm is that two proteins sharing some higher-order topological similarities, measured by a novel random walk-based procedure, are likely interacting with each other and may belong to the same protein complex.

resultsApplying our algorithm to a yeast PPI network, we found that the edges in the reconstructed network have higher biological relevance than in the original network, assessed by multiple types of information, including gene ontology, gene expression, essentiality, conservation between species and known protein complexes. Comparison with existing methods shows that the network reconstructed by our method has the highest quality. Using two independent graph clustering algorithms, we found that the reconstructed network has resulted in significantly improved prediction accuracy of protein complexes. Furthermore, our method is applicable to PPI networks obtained with different experimental systems, such as affinity purification, yeast two-hybrid (Y2H) and protein-fragment complementation assay (PCA), and evidence shows that the predicted edges are likely bona fide physical interactions. Finally, an application to a human PPI network increased the coverage of the network by at least 100%. AVAILABILITY: www.cs.utsa.edu/∼jruan/RWS/.

Indexed as

AlgorithmsCluster AnalysisHumansMultiprotein ComplexesProtein Interaction MappingProtein Interaction MapsSaccharomyces cerevisiae ProteinsMultiprotein ComplexesSaccharomyces cerevisiae Proteins

Identifiers

PMID23235927
PMCPMC3562060

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.