MTGCL: Multi-Task Graph Contrastive Learning for Identifying Cancer Driver Genes from Multi-omics Data

Author:

Xie Ming-Yu,Zhang Shao-WuORCID,Zhang Tong,Li YanORCID,Cui Xiaodong

Abstract

AbstractCancer is a complex disease that typically arises from the accumulation of mutations in driver genes. Identification of cancer driver genes is crucial for understanding the molecular mechanisms of cancer, and developing the targeted therapeutic approaches. With the development of high-throughput biological technology, a large amount of genomic data and protein interaction network data have been generated, which provides abundant data resources for identifying cancer driver genes through computational methods. Given the ability of graph neural networks to effectively integrate graph structure topology information and node features information, some graph neural network-based methods have been developed for identifying cancer driver genes. However, these methods suffer from the sparse supervised signals, and also neglect a large amount of unlabeled node information, thereby affecting their ability to identify cancer driver genes. To tackle these issues, in this work we propose a novel Multi-Task Graph Contrastive Learning framework (called MTGCL) to identify cancer driver genes. By using self-supervised graph contrastive learning to fully utilize the unlabeled node information, MTGCL designs an auxiliary task module to enhance the performance of the main task of driver gene identification. MTGCL simultaneously trains the auxiliary task and main task, and shares the graph convolutional encoder weights, so that the main task enhances the discriminative ability of the auxiliary task via supervised learning, whereas the auxiliary task exploits the unlabeled node information to refine the node representation learning of the main task. The experimental results on pan-cancer and some specific cancers demonstrate the effectiveness of MTGCL in identifying the cancer driver genes. In addition, integrating multi-omics features extracted from multiple cancer-related databases can greatly enhance the performance of identifying cancer driver genes, especially, somatic mutation features can effectively improve the performance of identifying specific cancer driver genes. The source code and data are available athttps://github.com/NWPU-903PR/MTGCL.Author SummaryIdentifying cancer driver genes that causally contribute to cancer initiation and progression is essential for comprehending the molecular mechanisms of cancer and developing the targeted therapeutic strategies. However, wet-lab experiments are time-consuming and labor-intensive. The advent of high-throughput multi-omics technology provides an opportunity for identifying the cancer driver genes through data-driven computing approaches. Nevertheless, effectively integrating these omics data to identify cancer driver genes poses significant challenges. Existing computational methods exhibit certain limitations. For instance, conventional approaches (e.g., gene mutation frequency-based methods, network-based methods) often focus on a single omics data, while existing deep learning-based methods have not fully utilized the abundant unlabeled node information, so that their identification accuracy is not high enough. Thus, by fully utilizing multidimensional genomics data and molecular interaction networks, we propose a multi-task learning framework (called MTGCL) to identify cancer driver genes. MTGCL synergistically combines graph convolutional neural networks with graph contrastive learning. The experimental results validate the power of MTGCL for identifying cancer driver genes.

Publisher

Cold Spring Harbor Laboratory

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3