Langore, TanojTanojLangoreHsu, Te ChengTe ChengHsuHsieh, Yi HsienYi HsienHsiehCHE LIN2024-01-182024-01-182023-01-01978-1-7281-6327-715206149https://scholars.lib.ntu.edu.tw/handle/123456789/638638One of the essential parts of drug discovery and design is the prediction of drug-target affinity (DTA). Researchers have proposed computational approaches for predicting DTA to circumvent the more expensive in vivo and in vitro tests. More recent approaches employed deep network architectures to obtain the features from the drug molecules and protein sequences. The drug compounds are represented as graphs and the target protein as a sequence to extract this information. In this work, we develop a new graph-based prediction model, termed LE-DTA, that utilizes local extrema convolutions for effective feature extraction. It focuses on the local and global extrema of graphs for node embedding. We investigated the performances of both the proposed models on three different benchmark datasets. Our proposed model showed improvement in CI by 1.12% and 0.35% and a reduction in MSE by 7.7% and 3.33% on the KIBA and BindingDB datasets, respectively. we also showed that despite using various pooling operations on our proposed model, we achieved an average reduction in MSE by 7% on the KIBA dataset and 3% improvement on the BindingDB dataset.Deep network architecture | drug-target interaction | graph neural network | local extremaconference paper10.1109/ICASSP49357.2023.100963472-s2.0-85180536901https://api.elsevier.com/content/abstract/scopus_id/85180536901