ArticlePloS one2014
Revealing missing parts of the interactome via link prediction.
Article in PloS one, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 21 papers.
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.
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.
Who cites it
21 citing papers in PubMed.
- Cross-modal embedding integrator for disease-gene/protein association prediction using a multi-head attention mechanism.Pharmacology research & perspectives · 2024Article
- Current and future directions in network biology.Bioinformatics advances · 2024Article
- D-SCRIPT translates genome to phenome with sequence-based, structure-aware, genome-scale predictions of protein-protein interactions.Cell systems · 2021Article
- Data-driven biological network alignment that uses topological, sequence, and functional information.BMC bioinformatics · 2021Article
- Performance Assessment of the Network Reconstruction Approaches on Various Interactomes.Frontiers in molecular biosciences · 2021Article
- Link Prediction through Deep Generative Model.iScience · 2020Article
- GLIDE: combining local methods and diffusion state embeddings to predict missing interactions in biological networks.Bioinformatics (Oxford, England) · 2020Article
- Data-driven network alignment.PloS one · 2020Article
- WIPER: Weighted in-Path Edge Ranking for biomolecular association networks.Quantitative biology (Beijing, China) · 2019Article
- Discovering large conserved functional components in global network alignment by graph matching.BMC genomics · 2018Article
- From homogeneous to heterogeneous network alignment via colored graphlets.Scientific reports · 2018Article
- GRAFENE: Graphlet-based alignment-free network approach integrates 3D structural and sequence (residue order) data to improve protein structural comparison.Scientific reports · 2017Article
- Link Prediction in Evolving Networks Based on Popularity of Nodes.Scientific reports · 2017Article
- Alignment of dynamic networks.Bioinformatics (Oxford, England) · 2017Article
- The integration of weighted human gene association networks based on link prediction.BMC systems biology · 2017Article
- Link prediction based on non-negative matrix factorization.PloS one · 2017Article
- Evolutionary analysis and interaction prediction for protein-protein interaction network in geometric space.PloS one · 2017Article
- A new two-stage method for revealing missing parts of edges in protein-protein interaction networks.PloS one · 2017Article
- SCOUT: simultaneous time segmentation and community detection in dynamic networks.Scientific reports · 2016Article
- Exploring the structure and function of temporal networks with dynamic graphlets.Bioinformatics (Oxford, England) · 2015Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Protein interaction networks (PINs) are often used to "learn" new biological function from their topology. Since current PINs are noisy, their computational de-noising via link prediction (LP) could improve the learning accuracy. LP uses the existing PIN topology to predict missing and spurious links. Many of existing LP methods rely on shared immediate neighborhoods of the nodes to be linked. As such, they have limitations. Thus, in order to comprehensively study what are the topological properties of nodes in PINs that dictate whether the nodes should be linked, we introduce novel sensitive LP measures that are expected to overcome the limitations of the existing methods. We systematically evaluate the new and existing LP measures by introducing "synthetic" noise into PINs and measuring how accurate the measures are in reconstructing the original PINs. Also, we use the LP measures to de-noise the original PINs, and we measure biological correctness of the de-noised PINs with respect to functional enrichment of the predicted interactions. Our main findings are: 1) LP measures that favor nodes which are both "topologically similar" and have large shared extended neighborhoods are superior; 2) using more network topology often though not always improves LP accuracy; and 3) LP improves biological correctness of the PINs, plus we validate a significant portion of the predicted interactions in independent, external PIN data sources. Ultimately, we are less focused on identifying a superior method but more on showing that LP improves biological correctness of PINs, which is its ultimate goal in computational biology. But we note that our new methods outperform each of the existing ones with respect to at least one evaluation criterion. Alarmingly, we find that the different criteria often disagree in identifying the best method(s), which has important implications for LP communities in any domain, including social networks.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.