Towards simplified graph neural networks for identifying cancer driver genes in heterophilic networks
2025

Simplified Graph Neural Networks for Identifying Cancer Driver Genes

Sample size: 29446 publication 10 minutes Evidence: high

Author Information

Author(s): Li Xingyi, Xu Jialuo, Li Junming, Gu Jia, Shang Xuequn

Primary Institution: Northwestern Polytechnical University

Hypothesis

Can a simplified graph neural network effectively identify cancer driver genes in heterophilic networks?

Conclusion

The SGCD model outperforms existing methods in identifying cancer driver genes and provides robust interpretability.

Supporting Evidence

  • SGCD shows superior performance compared to state-of-the-art methods.
  • Interpretability experiments validate the reliability of SGCD.
  • SGCD can dissect gene modules, revealing connections between driver genes.

Takeaway

This study created a new computer model to find important genes that cause cancer by looking at how genes interact with each other.

Methodology

The study used a simplified graph neural network model that integrates multi-omics data and biological networks to identify cancer driver genes.

Limitations

The model's performance may vary with different datasets and the complexity of biological networks.

Digital Object Identifier (DOI)

10.1093/bib/bbae691

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication