Evidence map›Paper›PMID 39751645›Full record

ArticleBriefings in bioinformatics2024

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

Xingyi Li, Jialuo Xu, Junming Li, Jia Gu, Xuequn Shang

Abstract read
In one paragraph

Article in Briefings in bioinformatics, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Xingyi LiSchool of Computer Science, Northwestern Polytechnical University, Xi'an, 710072 Shaanxi, China.
Jialuo XuSchool of Computer Science, Northwestern Polytechnical University, Xi'an, 710072 Shaanxi, China.
Junming LiResearch & Development Institute of Northwestern Polytechnical University in Shenzhen, Shenzhen, 518063 Guangdong, China.
Jia GuSchool of Software, Northwestern Polytechnical University, Xi'an, 710072 Shaanxi, China.
Xuequn ShangSchool of Computer Science, Northwestern Polytechnical University, Xi'an, 710072 Shaanxi, China.

Funding

Guangdong Basic and Applied Basic Research Foundation 2024A1515012602Macau Young Scholars Program AM2024027National Key Research and Development Program of China 2022YFD1801200National Natural Science Foundation of China 62202383Science and Technology Development Fund of Macao 0002/2024/RIA1State Key Laboratory for Animal Disease Control and Prevention Foundation SKLADCPKFKT202407
6 · The paper itself

Abstract

The identification of cancer driver genes is crucial for understanding the complex processes involved in cancer development, progression, and therapeutic strategies. Multi-omics data and biological networks provided by numerous databases enable the application of graph deep learning techniques that incorporate network structures into the deep learning framework. However, most existing methods do not account for the heterophily in the biological networks, which hinders the improvement of model performance. Meanwhile, feature confusion often arises in models based on graph neural networks in such graphs. To address this, we propose a Simplified Graph neural network for identifying Cancer Driver genes in heterophilic networks (SGCD), which comprises primarily two components: a graph convolutional neural network with representation separation and a bimodal feature extractor. The results demonstrate that SGCD not only performs exceptionally well but also exhibits robust discriminative capabilities compared to state-of-the-art methods across all benchmark datasets. Moreover, subsequent interpretability experiments on both the model and biological aspects provide compelling evidence supporting the reliability of SGCD. Additionally, the model can dissect gene modules, revealing clearer connections between driver genes in cancers. We are confident that SGCD holds potential in the field of precision oncology and may be applied to prognosticate biomarkers for a wide range of complex diseases.

Indexed as

Gene Regulatory NetworksNeoplasmsNeural Networks, ComputerAlgorithmsComputational BiologyDeep LearningHumanscancer driver genesgraph neural networksheterophilic networksmulti-omics dataprecision oncology

Identifiers

PMID39751645
PMCPMC11697181

What Socratic holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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 Socratic graph.