[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-seo-344172-105":3,"detail-sidebar-cat-0-en-105":81,"doc-detail-344172-en":130},{"code":4,"msg":5,"data":6},0,"ok",{"site_id":7,"language":8,"slug":9,"title":10,"keywords":11,"description":12,"schema_data":13,"social_meta":74,"head_meta":76,"extra_data":78,"updated_unix":80},105,"en","towards-simplified-graph-neural-networks-for-identifying-cancer-driver-genes-in-heterophilic-networks-abstract","Towards simplified graph neural networks for identifying cancer driver genes in heterophilic networks - Abstract","","The identification of cancer driver genes is essential for understanding how cancer develops, progresses, and responds to therapy. Large-scale multi-omics data and biological networks enable graph deep learning approaches that integrate network structure into gene representation learning. Existing methods often overlook heterophily in biological networks and can suffer from feature confusion in graph neural network models, limiting performance. To overcome this, SGCD introduces a simplified graph neural network with representation separation and a bimodal feature extractor, achieving strong results and robust discriminative ability across benchmark datasets while supporting interpretability and gene-module analysis for precision oncology.",{"@graph":14,"@context":73},[15,34,56],{"@type":16,"itemListElement":17},"BreadcrumbList",[18,23,27,31],{"item":19,"name":20,"@type":21,"position":22},"https://docshare.wps.com","Home","ListItem",1,{"item":24,"name":25,"@type":21,"position":26},"https://docshare.wps.com/document/","Document",2,{"item":28,"name":29,"@type":21,"position":30},"https://docshare.wps.com/document/research-report/","Research & Report",3,{"item":32,"name":10,"@type":21,"position":33},"https://docshare.wps.com/document/towards-simplified-graph-neural-networks-for-identifying-cancer-driver-genes-in-heterophilic-networks-abstract/344172/",4,{"url":32,"name":10,"@type":35,"image":36,"author":41,"headline":10,"publisher":44,"fileFormat":47,"inLanguage":8,"description":12,"dateModified":48,"datePublished":49,"encodingFormat":47,"isAccessibleForFree":50,"interactionStatistic":51},"DigitalDocument",{"url":37,"@type":38,"width":39,"height":40},"https://docshare.wps.com/thumbnails/towards-simplified-graph-neural-networks-for-identifying-cancer-driver-genes-in-heterophilic-networks-abstract/344172.png","ImageObject",300,407,{"name":42,"@type":43},"Clementine","Person",{"url":19,"name":45,"@type":46},"DocShare","Organization","application/pdf","2026-11-07","2026-09-22",true,{"@type":52,"interactionType":53,"userInteractionCount":55},"InteractionCounter",{"@type":54},"ViewAction",9,{"@type":57,"mainEntity":58},"FAQPage",[59,65,69],{"name":60,"@type":61,"acceptedAnswer":62},"Why is identifying cancer driver genes important?","Question",{"text":63,"@type":64},"Accurate identification helps clarify biological processes underlying cancer development and supports advances in personalized oncology strategies.","Answer",{"name":66,"@type":61,"acceptedAnswer":67},"What limitations affect existing methods on biological graphs?",{"text":68,"@type":64},"Many methods do not account for heterophily in biological networks, and feature confusion can occur in graph neural network models, reducing performance.",{"name":70,"@type":61,"acceptedAnswer":71},"How does SGCD address these issues?",{"text":72,"@type":64},"SGCD is built around a graph convolutional neural network with representation separation and a bimodal feature extractor, improving discrimination on heterophilic networks.","https://schema.org",{"og:url":32,"og:type":75,"og:title":10,"og:site_name":45,"og:description":12},"article",{"robots":77,"canonical":32},"index,follow",{"doc_id":79,"site_id":7},344172,1790444232,{"code":4,"msg":82,"data":83},"success",[84,88,92,96,101,106,111,115,119,122,126],{"id":22,"doc_module":4,"doc_module_name":25,"category_name":85,"show_sort_weight":86,"slug":87},"Story & Novel",90,"story-novel",{"id":26,"doc_module":4,"doc_module_name":25,"category_name":89,"show_sort_weight":90,"slug":91},"Literature",80,"literature",{"id":33,"doc_module":4,"doc_module_name":25,"category_name":93,"show_sort_weight":94,"slug":95},"Exam",70,"exam",{"id":97,"doc_module":4,"doc_module_name":25,"category_name":98,"show_sort_weight":99,"slug":100},5,"Comic",60,"comic",{"id":102,"doc_module":4,"doc_module_name":25,"category_name":103,"show_sort_weight":104,"slug":105},6,"Technology",50,"technology",{"id":107,"doc_module":4,"doc_module_name":25,"category_name":108,"show_sort_weight":109,"slug":110},7,"Healthcare",40,"healthcare",{"id":112,"doc_module":4,"doc_module_name":25,"category_name":29,"show_sort_weight":113,"slug":114},8,30,"research-report",{"id":55,"doc_module":4,"doc_module_name":25,"category_name":116,"show_sort_weight":117,"slug":118},"Religion & Spirituality",20,"religion-spirituality",{"id":117,"doc_module":4,"doc_module_name":25,"category_name":120,"show_sort_weight":117,"slug":121},"World Cup","world-cup",{"id":123,"doc_module":4,"doc_module_name":25,"category_name":124,"show_sort_weight":123,"slug":125},10,"Lifestyle","lifestyle",{"id":127,"doc_module":4,"doc_module_name":25,"category_name":128,"show_sort_weight":97,"slug":129},19,"General","general",{"code":4,"msg":82,"data":131},{"doc_id":79,"user_id":132,"nickname":42,"user_avatar":133,"doc_module":4,"category_id":112,"category_name":29,"doc_title":10,"doc_description":12,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":55,"is_deleted":4,"is_public":22,"is_downloadable":22,"audit_status":22,"page_count":139,"language":140,"language_code":8,"site_id":7,"html_lang":8,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":12,"update_tm":144,"read_time":145,"preview_page_count":33,"preview_urls":146},1374391974564,"https://ap-avatar.wpscdn.com/avatar/14000253aa45c000a9e?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779874745381141002","Briefings in Bioinformatics, 2025, 26(1), bbae691  \n[https://doi.org/10.1093/bib/bbae691](https://doi.org/10.1093/bib/bbae691)  \nProblem Solving Protocol  \nTowards simplified graph neural networks for  \nidentifying cancer driver genes in heterophilic networks  \nXingyi Li1 , 2 , 3 , *, Jialuo Xu1 , Junming Li2 ,4 , Jia Gu4 , Xuequn Shang1 , *  \n1 School of Computer Science, Northwestern Polytechnical University, Xi’an, 710072 Shaanxi, China  \n2 Research & Development Institute of Northwestern Polytechnical University in Shenzhen, Shenzhen, 518063 Guangdong, China  \n3 Faculty of Data Science, City University of Macau, Macau, 999078 Macau, China  \n4 School of Software, Northwestern Polytechnical University, Xi’an, 710072 Shaanxi, China  \n*Corresponding authors. Xingyi Li, E-mail: [xingyili@nwpu.edu.cn](xingyili@nwpu.edu.cn); Xuequn Shang, E-mail: [shang@nwpu.edu.cn](shang@nwpu.edu.cn)  \nAbstract  \nThe 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-ofthe-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.  \nKeywords: cancer driver genes; multi-omics data; graph neural networks; heterophilic networks; precision oncology  \nIntroduction  \nIn biomedical research, it is generally accepted that the onset of cancer is associated with the accumulation of mutations in driver genes. Therefore, accurately identifying cancer driver genesis paramount for clarifying the biological processes that underlie carcinogenesis and for the advancement of personalized oncology pharmaceuticals [1 , 2] .  \nOver the past decade, many statistics methods have emerged to detect cancer driver genes. The approaches based on frequency such as MuSic [3], MutSigCV [4], and OncodriveCLUST [5] generally operate under the assumption that mutations in driver genes tend to recur more often across samples compared to those in nondriver genes, thereby facilitating the recognition of highly mutated genes as cancer driver genes. Nonetheless, these techniques often struggle to identify driver genes with rare mutations.  \nAs machine learning (ML) advances rapidly and large-scale cancer genomics projects involving thousands of patients continue to release multi-omics data [6–8], numerous ML-based approaches have also shown noteworthy success in identifying cancer driver genes. Essentially, these methods concentrate on deriving low-dimensional representations of genes from a variety of biological attributes to effectively distinguish driver genes from non-driver genes. For instance, LOTUS [9] employs  \na support vector machine to detect pan-cancer driver genes, while TUSON [10] utilizes a LASSO regression fo","cbCaitoa5L3sQKJm","https://ap.wps.com/l/cbCaitoa5L3sQKJm","pdf",2046156,11,"English","# Introduction\n## Cancer driver gene identification\n## Frequency-based and ML-based approaches\n## Network-based and graph neural network methods\n## Motivation and related work","[{\"question\":\"Why is identifying cancer driver genes important?\",\"answer\":\"Accurate identification helps clarify biological processes underlying cancer development and supports advances in personalized oncology strategies.\"},{\"question\":\"What limitations affect existing methods on biological graphs?\",\"answer\":\"Many methods do not account for heterophily in biological networks, and feature confusion can occur in graph neural network models, reducing performance.\"},{\"question\":\"How does SGCD address these issues?\",\"answer\":\"SGCD is built around a graph convolutional neural network with representation separation and a bimodal feature extractor, improving discrimination on heterophilic networks.\"}]","Towards simplified graph neural networks for identifying cancer driver genes in heterophilic networks - Abstract | PDF",1790053155,28,[147,151,155,159],{"page_no":22,"url":148,"width":149,"height":150},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/4e364e08e86343d14fc60bf64f3dd5c3.webp",983,1291,{"page_no":26,"url":152,"width":153,"height":154},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/543a6432778b4c4b54c7bc6f7ce4da83.webp",982,1290,{"page_no":30,"url":156,"width":157,"height":158},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/a1f8be442a36cc4da7a3c8e0bb5e2943.webp",981,1289,{"page_no":33,"url":160,"width":161,"height":162},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/718910967e8c3b0b85e756e8956a1a53.webp",980,1287]