Gene regulatory network inference algorithm based on spectral signed directed graph convolution
- URL: http://arxiv.org/abs/2512.11927v1
- Date: Fri, 12 Dec 2025 00:54:53 GMT
- Title: Gene regulatory network inference algorithm based on spectral signed directed graph convolution
- Authors: Rijie Xi, Weikang Xu, Wei Xiong, Yuannong Ye, Bin Zhao,
- Abstract summary: We propose MSGRNLink, a novel framework that explicitly models GRNs as signed directed graphs and employs magnetic signed Laplacian convolution.<n>In a bladder cancer case study, MSGRNLink predicted more known edges and edge signs than benchmark models, further validating its biological relevance.
- Score: 11.166270329149205
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Accurately reconstructing Gene Regulatory Networks (GRNs) is crucial for understanding gene functions and disease mechanisms. Single-cell RNA sequencing (scRNA-seq) technology provides vast data for computational GRN reconstruction. Since GRNs are ideally modeled as signed directed graphs to capture activation/inhibition relationships, the most intuitive and reasonable approach is to design feature extractors based on the topological structure of GRNs to extract structural features, then combine them with biological characteristics for research. However, traditional spectral graph convolution struggles with this representation. Thus, we propose MSGRNLink, a novel framework that explicitly models GRNs as signed directed graphs and employs magnetic signed Laplacian convolution. Experiments across simulated and real datasets demonstrate that MSGRNLink outperforms all baseline models in AUROC. Parameter sensitivity analysis and ablation studies confirmed its robustness and the importance of each module. In a bladder cancer case study, MSGRNLink predicted more known edges and edge signs than benchmark models, further validating its biological relevance.
Related papers
- Beyond Conditional Computation: Retrieval-Augmented Genomic Foundation Models with Gengram [7.122805911264195]
Gengram is a conditional memory module that introduces an explicit and highly efficient lookup primitive for multi-base motifs.<n>It is integrated into the backbone of state-of-the-art genomic foundation models.<n>By establishing structured motif memory as a modeling primitive, Gengram simultaneously boosts empirical performance and mechanistic interpretability.
arXiv Detail & Related papers (2026-01-29T17:43:10Z) - A Novel Graph Transformer Framework for Gene Regulatory Network Inference [0.27624021966289597]
Inference of gene regulatory networks (GRNs) may not always reflect true biological interactions.<n>Most GRN inference methods face several challenges in the network reconstruction phase.<n>We employ autoencoder embeddings to capture gene expression patterns directly from raw data.<n>We embed the prior knowledge from GRN structures transforming them into a text-like representation.
arXiv Detail & Related papers (2025-04-23T06:24:26Z) - GRNFormer: A Biologically-Guided Framework for Integrating Gene Regulatory Networks into RNA Foundation Models [39.58414436685698]
We propose a new framework that integrates multi-scale Gene Regulatory Networks (GRNs) inferred from multi-omics data into RNA foundation model training.<n>GRNFormer achieves consistent improvements over state-of-the-art (SoTA) baselines.
arXiv Detail & Related papers (2025-03-03T15:56:39Z) - Analysis of Gene Regulatory Networks from Gene Expression Using Graph Neural Networks [0.4369058206183195]
This study explores the use of Graph Neural Networks (GNNs), a powerful approach for modeling graph-structured data like Gene Regulatory Networks (GRNs)
The model's adeptness in accurately predicting regulatory interactions and pinpointing key regulators is attributed to advanced attention mechanisms.
The integration of GNNs in GRN research is set to pioneer developments in personalized medicine, drug discovery, and our grasp of biological systems.
arXiv Detail & Related papers (2024-09-20T17:16:14Z) - Gene Regulatory Network Inference from Pre-trained Single-Cell Transcriptomics Transformer with Joint Graph Learning [10.44434676119443]
Inferring gene regulatory networks (GRNs) from single-cell RNA sequencing (scRNA-seq) data is a complex challenge.
In this study, we tackle this challenge by leveraging the single-cell BERT-based pre-trained transformer model (scBERT)
We introduce a novel joint graph learning approach that combines the rich contextual representations learned by single-cell language models with the structured knowledge encoded in GRNs.
arXiv Detail & Related papers (2024-07-25T16:42:08Z) - Relation Embedding based Graph Neural Networks for Handling
Heterogeneous Graph [58.99478502486377]
We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs.
Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
arXiv Detail & Related papers (2022-09-23T05:24:18Z) - Learnable Filters for Geometric Scattering Modules [64.03877398967282]
We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms.
Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
arXiv Detail & Related papers (2022-08-15T22:30:07Z) - Simple and Efficient Heterogeneous Graph Neural Network [55.56564522532328]
Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations.
Existing HGNNs inherit many mechanisms from graph neural networks (GNNs) over homogeneous graphs, especially the attention mechanism and the multi-layer structure.
This paper conducts an in-depth and detailed study of these mechanisms and proposes Simple and Efficient Heterogeneous Graph Neural Network (SeHGNN)
arXiv Detail & Related papers (2022-07-06T10:01:46Z) - Prediction of gene expression time series and structural analysis of
gene regulatory networks using recurrent neural networks [0.0]
This work provides a a way to understand and exploit the attention mechanism of RNN.
It paves the way to RNN-based methods for time series prediction and inference of GRNs from gene expression data.
arXiv Detail & Related papers (2021-09-13T10:30:21Z) - Lightweight, Dynamic Graph Convolutional Networks for AMR-to-Text
Generation [56.73834525802723]
Lightweight Dynamic Graph Convolutional Networks (LDGCNs) are proposed.
LDGCNs capture richer non-local interactions by synthesizing higher order information from the input graphs.
We develop two novel parameter saving strategies based on the group graph convolutions and weight tied convolutions to reduce memory usage and model complexity.
arXiv Detail & Related papers (2020-10-09T06:03:46Z) - Data-Driven Learning of Geometric Scattering Networks [74.3283600072357]
We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms.
Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
arXiv Detail & Related papers (2020-10-06T01:20:27Z) - Infinitely Wide Graph Convolutional Networks: Semi-supervised Learning
via Gaussian Processes [144.6048446370369]
Graph convolutional neural networks(GCNs) have recently demonstrated promising results on graph-based semi-supervised classification.
We propose a GP regression model via GCNs(GPGC) for graph-based semi-supervised learning.
We conduct extensive experiments to evaluate GPGC and demonstrate that it outperforms other state-of-the-art methods.
arXiv Detail & Related papers (2020-02-26T10:02:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.