Edge Generation-guided Relation-aware Learning (EGRL) is proposed, a novel framework with several key components: implicit meta-path learning to capture relational semantics without handcrafted paths; a multi-relation-aware attention mechanism for adaptive fusion of interaction patterns; a graph generator that predicts potential ("soft") edges to support cold-start nodes; and a multi-feature fusion predictor for final interaction scoring.
Abstract
RNA-Protein Interactions (RPIs) are critical for regulating cellular functions. While traditional wet-lab experiments for RPI detection are costly and time-consuming, Deep Learning (DL) methods provide an efficient computational alternative for RPI Prediction (RPIP). In particular, Graph Neural Networks (GNNs) are promising, as they naturally model RPI networks. However, existing GNN-based methods often rely on homogeneous graphs or predefined meta-paths, which limit their ability to handle data sparsity and to generalize to cold-start scenarios involving unknown molecules. To address these limitations, we propose Edge Generation-guided Relation-aware Learning (EGRL), a novel framework with several key components: implicit meta-path learning to capture relational semantics without handcrafted paths; a multi-relation-aware attention mechanism for adaptive fusion of interaction patterns; a graph generator that predicts potential ("soft") edges to support cold-start nodes; and a multi-feature fusion predictor for final interaction scoring. EGRL is jointly trained with a primary task loss and an auxiliary generator loss. Comprehensive evaluations on four benchmark datasets demonstrate that EGRL achieves competitive overall performance. More importantly, it exhibits superior generalization in cold-start settings, achieving an Area Under the Receiver Operating Characteristic curve (AUROC) of 0.867 and an Area Under the Precision-Recall curve (AUPR) of 0.861 on unknown molecules, corresponding to improvements of 8.6% in AUROC and 5.0% in AUPR over prior state-of-the-art methods. The code will be released soon.
A structure-aware interleaved-attention graph learning framework, termed IAGRN, is proposed for GRN inference from scRNA-seq data that interleaves topology-constrained local attention with distance-aware global attention, enabling effective integration of structural priors and long-range regulatory signals.
Yue Wang, Si-Cheng Tian, Dan Li· International Journal of Mol...· 0 citations
This work presents HGRL-PPIS, a novel hierarchical graph representation learning approach for predicting protein-protein interaction sites that achieves superior performance over competing methods on multiple benchmark datasets, enabling more reliable detection of protein-protein binding residues.
This study reviews the methodological evolution from conventional machine learning to deep learning, graph neural networks and large-scale pre-trained language models, and compares their differences in data preparation, evaluation protocols and generalization behavior, and places particular emphasis on recent advances in structure-aware and condition-aware models.
This work proposes ARF-GNN, an adaptive receptive field graph neural network tailored for protein function prediction, which dynamically models structural context via hierarchical multi-hop neighborhood aggregation and introduces a dual-branch meta-learning framework.
Zhiqiang Hui, Weizhong Lu, Yiyi Xia et al.· Computational biology and ch...· 0 citations
An innovative two-stage deep learning framework that combines residue-level graph representation learning with protein-level regression to achieve a thorough modeling of protein interactions and gives a better understanding of the structural processes that control PPI.
Oras A. Hussein, E. Al-Shamery· Journal of Intelligent Infor...· 0 citations
This work proposes bioMoR, which is the first framework to apply MoR to gene-level and pathway-level learning, and identifies three locations for integrating structured biological knowledge within an MoR backbone: graph-based information sharing refines token embeddings, a structural bias guides self-attention toward biologically related tokens, and a graph-aware router uses neighborhood information to determine each token's recursion depth.
Koushik Howlader, Tirtho Roy, Md Tauhidul Islam et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.