The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A novel link prediction algorithm for reconstructing protein–protein interaction networks by topological similarity
Open accessAbstract
Motivation: Recent 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. Results: Applying 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/. Contact: Jianhua.Ruan@utsa.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes
Gasch, A. P., Spellman, P. T., Kao, C. M., Carmel-Harel, O., Eisen, M. B., Storz, G., Botstein, D., & Brown, P. O. (2000) · Molecular Biology of the Cell · doi:10.1091/mbc.11.12.4241 · Cited by 4,815
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
Network‐based classification of breast cancer metastasis
Chuang, H., Lee, E., Liu, Y., Lee, D., & Ideker, T. (2007) · Molecular Systems Biology · doi:10.1038/msb4100180 · Cited by 1,431
High-Quality Binary Protein Interaction Map of the Yeast Interactome Network
Yu, H., Braun, P., Yıldırım, M. A., Lemmens, I., Venkatesan, K., Sahalie, J., Hirozane-Kishikawa, T., Gebreab, F., Li, N., Simonis, N., et al. (2008) · Science · doi:10.1126/science.1158684 · Cited by 1,392
GOSemSim: an R package for measuring semantic similarity among GO terms and gene products
Yu, G., Li, F., Qin, Y., Bo, X., Wu, Y., & Wang, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq064 · Cited by 1,388
A new method to measure the semantic similarity of GO terms
Wang, J. Z., Du, Z., Payattakool, R., Yu, P. S., & Chen, C.-F. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm087 · Cited by 1,377
Ideker, T., & Sharan, R. (2008) · Genome Research · doi:10.1101/gr.071852.107 · Cited by 817
Geometric De-noising of Protein-Protein Interaction Networks
Kuchaiev, O., Rašajski, M., Higham, D. J., & Pržulj, N. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000454 · Cited by 180
Cited by
Network propagation: a universal amplifier of genetic associations
Cowen, L., Ideker, T., Raphael, B. J., & Sharan, R. (2017) · Nature Reviews Genetics · doi:10.1038/nrg.2017.38 · Cited by 657
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Gene ontology semantic similarity analysis using GOSemSim
Yu, G. (2020) · Methods in Molecular Biology · doi:10.1007/978-1-0716-0301-7_11 · Cited by 392
SkipGNN: predicting molecular interactions with skip-graph networks
Huang, K., Xiao, C., Glass, L. M., Zitnik, M., & Sun, J. (2020) · Scientific Reports · doi:10.1038/s41598-020-77766-9 · Cited by 133
Li, H., Sun, Y., Hong, H., Huang, X., Tao, H., Huang, Q., Wang, L., Xu, K., Gan, J., Chen, H., et al. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00469-5 · Cited by 66
Metadata
- Authors
- Lei, C., & Ruan, J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-12-11
- Volume
- 29
- Issue
- 3
- Pages
- 355-364
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2118169662
- Cited by
- 197
- References
- 8
- FWCI
- 2.67
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A novel link prediction algorithm for reconstructing protein–protein interaction networks by topological similarity. https://app.cochat.ai/papers/10.1093/bioinformatics/bts688
- The paper
- Lei, C., & Ruan, J. (2013). A novel link prediction algorithm for reconstructing protein–protein interaction networks by topological similarity. Bioinformatics. https://doi.org/10.1093/bioinformatics/bts688
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.