<HashMap><database>biostudies-literature</database><scores/><additional><submitter>Li X</submitter><funding>Science and Technology Development Fund of Macao</funding><funding>Guangdong Basic and Applied Basic Research Foundation</funding><funding>National Natural Science Foundation of China</funding><funding>State Key Laboratory for Animal Disease Control and Prevention Foundation</funding><funding>Macau Young Scholars Program</funding><funding>National Key Research and Development Program of China</funding><pagination>bbae691</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC11697181</full_dataset_link><repository>biostudies-literature</repository><omics_type>Unknown</omics_type><volume>26(1)</volume><pubmed_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 convoluti</pubmed_abstract><journal>Briefings in bioinformatics</journal><pubmed_title>Towards simplified graph neural networks for identifying cancer driver genes in heterophilic networks.</pubmed_title><pmcid>PMC11697181</pmcid><funding_grant_id>62202383</funding_grant_id><funding_grant_id>AM2024027</funding_grant_id><funding_grant_id>0002/2024/RIA1</funding_grant_id><funding_grant_id>2022YFD1801200</funding_grant_id><funding_grant_id>SKLADCPKFKT202407</funding_grant_id><funding_grant_id>2024A1515012602</funding_grant_id><pubmed_authors>Li X</pubmed_authors><pubmed_authors>Li J</pubmed_authors><pubmed_authors>Gu J</pubmed_authors><pubmed_authors>Shang X</pubmed_authors><pubmed_authors>Xu J</pubmed_authors></additional><is_claimable>false</is_claimable><name>Towards simplified graph neural networks for identifying cancer driver genes in heterophilic networks.</name><description>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 convoluti</description><dates><release>2024-01-01T00:00:00Z</release><publication>2024 Nov</publication><modification>2025-04-04T12:02:33.059Z</modification><creation>2025-04-04T12:02:33.059Z</creation></dates><accession>S-EPMC11697181</accession><cross_references><pubmed>39751645</pubmed><doi>10.1093/bib/bbae691</doi></cross_references></HashMap>