MDAGCN: Predicting Mutation-Drug Associations Through Signed Graph Convolutional Networks via Graph Sampling

The surge in accessible high-throughput molecular data presents computational challenges for the precision medicine in cancer. Genetic mutations have the potential to act as reliable biomarkers indicating responses to targeted drugs. Accurate prediction of mutation-drug associations is critically important for drug development and cancer treatment. We propose a novel graph convolutional network method, MDAGCN, to predict the mutation-drug associations with specific types (sensitive/resistant) in cancer. To enhance both the efficiency and accuracy of training, we begin by constructing a feature and topological graph using the k-Nearest Neighbors algorithm, incorporating the structural relationship and feature data associated with mutation-drug interactions. Experimental results show that MDAGCN outperforms state-of-the-art methods in different experimental settings. Moreover, we show the effectiveness of graph sampling technique for training signed graphs. MDAGCN is a comprehensive end-to-end framework that could be broadly applicable to cancer pharmacogenomics. This framework has the potential to facilitate the mapping from the discovering novel mutation-drug associations to in-depth analysis of drug sensitivity and resistance.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Biology and Bioinformatics
Published
2025-03-31
DOI
https://doi.org/10.1109/tcbbio.2025.3556409
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MDAGCN: Predicting Mutation-Drug Associations Through Signed Graph Convolutional Networks via Graph Sampling

Ying Xiang, Lichuan Gu, Zhenyu Yue, Tao Xu et al.
IEEE Transactions on Computational Biology and Bioinformatics
Computational Drug Discovery Methods
article

MDAGCN: Predicting Mutation-Drug Associations Through Signed Graph Convolutional Networks via Graph Sampling

Ying Xiang, Lichuan Gu, Zhenyu Yue, Tao Xu, Xiaosong Wang, Xiaodi Li
article en

Abstract

The surge in accessible high-throughput molecular data presents computational challenges for the precision medicine in cancer. Genetic mutations have the potential to act as reliable biomarkers indicating responses to targeted drugs. Accurate prediction of mutation-drug associations is critically important for drug development and cancer treatment. We propose a novel graph convolutional network method, MDAGCN, to predict the mutation-drug associations with specific types (sensitive/resistant) in cancer. To enhance both the efficiency and accuracy of training, we begin by constructing a feature and topological graph using the k-Nearest Neighbors algorithm, incorporating the structural relationship and feature data associated with mutation-drug interactions. Experimental results show that MDAGCN outperforms state-of-the-art methods in different experimental settings. Moreover, we show the effectiveness of graph sampling technique for training signed graphs. MDAGCN is a comprehensive end-to-end framework that could be broadly applicable to cancer pharmacogenomics. This framework has the potential to facilitate the mapping from the discovering novel mutation-drug associations to in-depth analysis of drug sensitivity and resistance.

IEEE Transactions on Computational Biology and BioinformaticsVol. 22(4)
Anhui Agricultural University (CN), Anhui University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Anhui Province, National Key Research and Development Program of China
Openalex Percentile: Top 93%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.