ArticleBioinformatics (Oxford, England)2013
Minimum curvilinearity to enhance topological prediction of protein interactions by network embedding.
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 54 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
54 citing papers in PubMed.
- Reward-enhanced encoding improves relearning of forgotten associations.Scientific reports · 2018Trial
- Unraveling cooperative and competitive interactions within protein triplets in the human interactome.Scientific reports · 2025Article
- Label-Free Proteomic Profiling of the dvls2 (CL2006) Caenorhabditis elegans Alzheimer's Disease (AD) Model Reveals Conserved Molecular Signatures Shared With the Human AD Brain.Journal of neurochemistry · 2025Article
- Article
- DeeWaNA: An Unsupervised Network Representation Learning Framework Integrating Deepwalk and Neighborhood Aggregation for Node Classification.Entropy (Basel, Switzerland) · 2025Article
- Article
- Simplicity within biological complexity.Bioinformatics advances · 2025Article
- A bioinformatics approach to elucidate conserved genes and pathways in C. elegans as an animal model for cardiovascular research.Scientific reports · 2024Article
- Article
- Proprotein Convertase Subtilisin/Kexin 9 (PCSK9) Promotes Macrophage Activation via LDL Receptor-Independent Mechanisms.Circulation research · 2022Article
- Progresses and challenges in link prediction.iScience · 2021Review
- Linear functional organization of the omic embedding space.Bioinformatics (Oxford, England) · 2021Article
- Network-based protein-protein interaction prediction method maps perturbations of cancer interactome.PLoS genetics · 2021Article
- Optimisation of the coalescent hyperbolic embedding of complex networks.Scientific reports · 2021Article
- Nonlinear machine learning pattern recognition and bacteria-metabolite multilayer network analysis of perturbed gastric microbiome.Nature communications · 2021Article
- Performance Assessment of the Network Reconstruction Approaches on Various Interactomes.Frontiers in molecular biosciences · 2021Article
- GLIDE: combining local methods and diffusion state embeddings to predict missing interactions in biological networks.Bioinformatics (Oxford, England) · 2020Article
- Graph embedding-based novel protein interaction prediction via higher-order graph convolutional network.PloS one · 2020Article
- Prediction of comorbid diseases using weighted geometric embedding of human interactome.BMC medical genomics · 2019Article
- To Embed or Not: Network Embedding as a Paradigm in Computational Biology.Frontiers in genetics · 2019Review
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
motivationMost functions within the cell emerge thanks to protein-protein interactions (PPIs), yet experimental determination of PPIs is both expensive and time-consuming. PPI networks present significant levels of noise and incompleteness. Predicting interactions using only PPI-network topology (topological prediction) is difficult but essential when prior biological knowledge is absent or unreliable.
methodsNetwork embedding emphasizes the relations between network proteins embedded in a low-dimensional space, in which protein pairs that are closer to each other represent good candidate interactions. To achieve network denoising, which boosts prediction performance, we first applied minimum curvilinear embedding (MCE), and then adopted shortest path (SP) in the reduced space to assign likelihood scores to candidate interactions. Furthermore, we introduce (i) a new valid variation of MCE, named non-centred MCE (ncMCE); (ii) two automatic strategies for selecting the appropriate embedding dimension; and (iii) two new randomized procedures for evaluating predictions.
resultsWe compared our method against several unsupervised and supervisedly tuned embedding approaches and node neighbourhood techniques. Despite its computational simplicity, ncMCE-SP was the overall leader, outperforming the current methods in topological link prediction.
conclusionMinimum curvilinearity is a valuable non-linear framework that we successfully applied to the embedding of protein networks for the unsupervised prediction of novel PPIs. The rationale for our approach is that biological and evolutionary information is imprinted in the non-linear patterns hidden behind the protein network topology, and can be exploited for predicting new protein links. The predicted PPIs represent good candidates for testing in high-throughput experiments or for exploitation in systems biology tools such as those used for network-based inference and prediction of disease-related functional modules. AVAILABILITY: https://sites.google.com/site/carlovittoriocannistraci/home. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
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.