ArticlePLoS computational biology2026
GPCR-GO: Relation-aware graph learning for predicting Gene Ontology terms of G protein-coupled receptors.
Article in PLoS computational biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
G protein-coupled receptors (GPCRs) are central membrane receptors and major therapeutic targets. However, predicting GPCR function remains difficult because experimentally annotated receptors are scarce, functional labels follow a long-tailed distribution, and structural information remains underused. Here, we present GPCR-GO, a relation-aware heterogeneous graph attention framework that integrates structural similarity with protein-protein interactions (PPIs). GPCR-GO uses the Dictionary of Protein Secondary Structure (DSSP) to transform three-dimensional protein structures into residue-level structural descriptors, aggregates these descriptors into protein-level structural vectors, and uses the resulting vectors to define structural-similarity edges. The framework builds a heterogeneous graph linking proteins and Gene Ontology (GO) terms through PPI edges, structural-similarity edges, GO hierarchy edges, and reviewed protein-GO annotations. Relation-aware graph attention aggregates complementary biological signals, whereas graph decomposition, hard negative mining, and semi-supervised learning improve learning under sparse supervision and class imbalance. On the held-out GPCR test split, GPCR-GO outperforms existing methods and achieves F-score (Fmax) values of 0.514, 0.767, and 0.631 on biological process (BP), cellular component (CC), and molecular function (MF), respectively. These results show that structure-derived relations complement curated annotation and support accurate GPCR function prediction under limited supervision.
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.