ArticleBMC systems biology2009
Spectral affinity in protein networks.
Article in BMC systems biology, 2009. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 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
14 citing papers in PubMed.
- MUNDO: protein function prediction embedded in a multispecies world.Bioinformatics advances · 2022Article
- Article
- The proteome and its dynamics: A missing piece for integrative multi-omics in schizophrenia.Schizophrenia research · 2020Article
- Using deep maxout neural networks to improve the accuracy of function prediction from protein interaction networks.PloS one · 2019Article
- Inferring hidden causal relations between pathway members using reduced Google matrix of directed biological networks.PloS one · 2018Article
- Network propagation: a universal amplifier of genetic associations.Nature reviews. Genetics · 2017Review
- Local Higher-Order Graph Clustering.KDD : proceedings. International Conference on Knowledge Discovery & Data Mining · 2017Article
- New directions for diffusion-based network prediction of protein function: incorporating pathways with confidence.Bioinformatics (Oxford, England) · 2014Article
- Prediction of protein interaction types based on sequence and network features.BMC systems biology · 2013Article
- A single source k-shortest paths algorithm to infer regulatory pathways in a gene network.Bioinformatics (Oxford, England) · 2012Article
- CytoITMprobe: a network information flow plugin for Cytoscape.BMC research notes · 2012Article
- Information flow in interaction networks II: channels, path lengths, and potentials.Journal of computational biology : a journal of computational molecular cell biology · 2012Article
- MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure.BMC bioinformatics · 2010Article
- It's the machine that matters: Predicting gene function and phenotype from protein networks.Journal of proteomics · 2010Review
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
backgroundProtein-protein interaction (PPI) networks enable us to better understand the functional organization of the proteome. We can learn a lot about a particular protein by querying its neighborhood in a PPI network to find proteins with similar function. A spectral approach that considers random walks between nodes of interest is particularly useful in evaluating closeness in PPI networks. Spectral measures of closeness are more robust to noise in the data and are more precise than simpler methods based on edge density and shortest path length.
resultsWe develop a novel affinity measure for pairs of proteins in PPI networks, which uses personalized PageRank, a random walk based method used in context-sensitive search on the Web. Our measure of closeness, which we call PageRank Affinity, is proportional to the number of times the smaller-degree protein is visited in a random walk that restarts at the larger-degree protein. PageRank considers paths of all lengths in a network, therefore PageRank Affinity is a precise measure that is robust to noise in the data. PageRank Affinity is also provably related to cluster co-membership, making it a meaningful measure. In our experiments on protein networks we find that our measure is better at predicting co-complex membership and finding functionally related proteins than other commonly used measures of closeness. Moreover, our experiments indicate that PageRank Affinity is very resilient to noise in the network. In addition, based on our method we build a tool that quickly finds nodes closest to a queried protein in any protein network, and easily scales to much larger biological networks.
conclusionWe define a meaningful way to assess the closeness of two proteins in a PPI network, and show that our closeness measure is more biologically significant than other commonly used methods. We also develop a tool, accessible at http://xialab.bu.edu/resources/pnns, that allows the user to quickly find nodes closest to a queried vertex in any protein network available from BioGRID or specified by the user.
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.