{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:10:59Z","timestamp":1784110259246,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]},{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]},{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]},{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]},{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]},{"name":"Innovation Project of New Generation Information Technology","award":["2021ITA09021"],"award-info":[{"award-number":["2021ITA09021"]}]},{"name":"Innovation Project of New Generation Information Technology","award":["2021ITA09021"],"award-info":[{"award-number":["2021ITA09021"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972134"],"award-info":[{"award-number":["61972134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972134"],"award-info":[{"award-number":["61972134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Teachers in Henan Province","award":["2020GGJS050"],"award-info":[{"award-number":["2020GGJS050"]}]},{"name":"Doctor Foundation of Henan Polytechnic University","award":["B2018-36"],"award-info":[{"award-number":["B2018-36"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Obtaining accurate drug\u2013target binding affinity (DTA) information is significant for drug discovery and drug repositioning. Although some methods have been proposed for predicting DTA, the features of proteins and drugs still need to be further analyzed. Recently, deep learning has been successfully used in many fields. Hence, designing a more effective deep learning method for predicting DTA remains attractive.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>Dynamic graph DTA (DGDTA), which uses a dynamic graph attention network combined with a bidirectional long short-term memory (Bi-LSTM) network to predict DTA is proposed in this paper. DGDTA adopts drug compound as input according to its corresponding simplified molecular input line entry system (SMILES) and protein amino acid sequence. First, each drug is considered a graph of interactions between atoms and edges, and dynamic attention scores are used to consider which atoms and edges in the drug are most important for predicting DTA. Then, Bi-LSTM is used to better extract the contextual information features of protein amino acid sequences. Finally, after combining the obtained drug and protein feature vectors, the DTA is predicted by a fully connected layer. The source code is available from GitHub at<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/luojunwei\/DGDTA\">https:\/\/github.com\/luojunwei\/DGDTA<\/jats:ext-link>.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>The experimental results show that DGDTA can predict DTA more accurately than some other methods.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-023-05497-5","type":"journal-article","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T09:01:58Z","timestamp":1696064518000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["DGDTA: dynamic graph attention network for predicting drug\u2013target binding affinity"],"prefix":"10.1186","volume":"24","author":[{"given":"Haixia","family":"Zhai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongli","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junwei","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengjiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"issue":"6","key":"5497_CR1","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1038\/nm.3595","volume":"20","author":"SM Strittmatter","year":"2014","unstructured":"Strittmatter SM. Old drugs learn new tricks. Nat Med. 2014;20(6):590.","journal-title":"Nat Med"},{"issue":"1","key":"5497_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-021-99269-x","volume":"12","author":"Affinity2Vec","year":"2022","unstructured":"Affinity2Vec. drug\u2013target binding affinity prediction through representation learning, graph mining, and machine learning. Sci Rep. 2022;12(1):1\u201318.","journal-title":"Sci Rep"},{"issue":"1","key":"5497_CR3","doi-asserted-by":"publisher","first-page":"13452","DOI":"10.1038\/s41598-021-92785-w","volume":"11","author":"S Wan","year":"2021","unstructured":"Wan S, Kumar D, Ilyin V, Homsi UA, Coveney PV. The effect of protein mutations on drug binding suggests ensuing personalised drug selection. Sci Rep. 2021;11(1):13452.","journal-title":"Sci Rep"},{"issue":"8","key":"5497_CR4","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1038\/nrd1468","volume":"3","author":"TT Ashburn","year":"2004","unstructured":"Ashburn TT, Thor KB. Drug repositioning: identifying and developing new uses for existing drugs. Nat Rev Drug Discov. 2004;3(8):673\u201383.","journal-title":"Nat Rev Drug Discov"},{"key":"5497_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ymeth.2016.06.024","volume":"110","author":"J Guan","year":"2016","unstructured":"Guan J, Tian K, Wang Y, Shao M, Zhou S. Boosting compound-protein interaction prediction by deep learning. Methods Companion Methods Enzymol. 2016;110:64\u201372.","journal-title":"Methods Companion Methods Enzymol"},{"key":"5497_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TCBB.2022.3144008","volume":"20","author":"Y Hua","year":"2022","unstructured":"Hua Y, Song X, Feng Z, Wu XJ, Kittler J, Yu DJ. CPInformer for efficient and robust compound\u2013protein interaction prediction. IEEE\/ACM Trans Comput Biol Bioinform. 2022;20:285\u201396.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"7270","key":"5497_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/nature08506","volume":"462","author":"KL Thomas","year":"2009","unstructured":"Thomas KL. Predicting new molecular targets for known drugs. Nature. 2009;462(7270):175\u201381.","journal-title":"Nature"},{"issue":"17","key":"5497_CR8","doi-asserted-by":"publisher","first-page":"i821","DOI":"10.1093\/bioinformatics\/bty593","volume":"34","author":"Z Hakime","year":"2018","unstructured":"Hakime Z. Arzucan Z, Elif O. DeepDTA: deep drug\u2013target binding affinity prediction. Bioinformatics. 2018;34(17):i821\u20139.","journal-title":"Bioinformatics"},{"issue":"4","key":"5497_CR9","doi-asserted-by":"publisher","first-page":"e0230726","DOI":"10.1371\/journal.pone.0230726","volume":"15","author":"B Krisztian","year":"2020","unstructured":"Krisztian B, Ladislav P, J\u00falia K. Modified linear regression predicts drug\u2013target interactions accurately. PLoS ONE. 2020;15(4):e0230726.","journal-title":"PLoS ONE"},{"issue":"8","key":"5497_CR10","doi-asserted-by":"publisher","first-page":"e1005678","DOI":"10.1371\/journal.pcbi.1005678","volume":"13","author":"A Cichonska","year":"2017","unstructured":"Cichonska A, Ravikumar B, Parri E, Timonen S, Pahikkala T, Airola A, Wennerberg K, Rousu J, Aittokallio T. Computational-experimental approach to drug\u2013target interaction mapping: a case study on kinase inhibitors. PLoS Comput Biol. 2017;13(8):e1005678.","journal-title":"PLoS Comput Biol"},{"key":"5497_CR11","first-page":"1","volume":"9","author":"T He","year":"2016","unstructured":"He T. SimBoost: a read-across approach for drug\u2013target interaction prediction using gradient boosting machines. J. Cheminform. 2016;9:1-14.","journal-title":"J. Cheminform."},{"issue":"Suppl 2","key":"5497_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1186\/s12911-020-1052-0","volume":"20","author":"YB Wang","year":"2020","unstructured":"Wang YB, Yi HC, Yang S, Chen ZH, Zheng K. A deep learning-based method for drug\u2013target interaction prediction based on long short-term memory neural network. BMC Med Inf Decis Mak. 2020;20(Suppl 2):49.","journal-title":"BMC Med Inf Decis Mak"},{"key":"5497_CR13","unstructured":"Feng Q, Dueva E, Cherkasov A, Ester M. PADME: a deep learning-based framework for drug\u2013target interaction prediction. 2018."},{"issue":"3","key":"5497_CR14","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1021\/ci400709d","volume":"54","author":"J Tang","year":"2014","unstructured":"Tang J, Szwajda A, Shakyawar S, Xu T, Aittokallio T. Making sense of large-scale kinase inhibitor bioactivity data sets: a comparative and integrative analysis. J Chem Inf Model. 2014;54(3):735\u201343.","journal-title":"J Chem Inf Model"},{"issue":"Web Server issu","key":"5497_CR15","doi-asserted-by":"publisher","first-page":"W441","DOI":"10.1093\/nar\/gkp253","volume":"37","author":"J Cer RZ","year":"2009","unstructured":"Cer RZ, Mudunuri U, Stephens R, Lebeda FJ. IC50-to-Ki: a web-based tool for converting IC50 to Ki values for inhibitors of enzyme activity and ligand binding. Nucleic Acids Res. 2009;37(Web Server issue):W441\u2013445.","journal-title":"Nucleic Acids Res"},{"key":"5497_CR16","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1093\/bioinformatics\/bty277","volume":"34","author":"A Cichonska","year":"2018","unstructured":"Cichonska A, Pahikkala T, Szedmak S, Julkunen H, Airola A, Heinonen M, Aittokallio T, Rousu J. Learning with multiple pairwise kernels for drug bioactivity prediction. Bioinformatics. 2018;34:509\u201318.","journal-title":"Bioinformatics"},{"key":"5497_CR17","doi-asserted-by":"crossref","unstructured":"\u00d6zt\u00fcrk H, Ozkirimli E, \u00d6zg\u00fcr A. WideDTA: prediction of drug\u2013target binding affinity. 2019.","DOI":"10.1093\/bioinformatics\/bty593"},{"key":"5497_CR18","unstructured":"Shin B, Park S, Kang K, Ho JC. Self-attention based molecule representation for predicting drug\u2013target interaction. In: Machine learning for healthcare conference: 2019. PMLR: p. 230\u2013248."},{"key":"5497_CR19","unstructured":"Lin X. DeepGS: deep representation learning of graphs and sequences for drug\u2013target binding affinity prediction. 2020."},{"key":"5497_CR20","unstructured":"Velikovi P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y. Graph attention networks. 2017."},{"key":"5497_CR21","doi-asserted-by":"crossref","unstructured":"Cho K, Merrienboer BV, Gulcehre C, Bahdanau D, Bougares F, Schwenk H, Bengio Y. Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078. 2014.","DOI":"10.3115\/v1\/D14-1179"},{"key":"5497_CR22","doi-asserted-by":"crossref","unstructured":"Qiu Z, Jiao Q, Wang Y, Chen C, Zhu D, Cui X. rzMLP-DTA: gMLP network with ReZero for sequence-based drug\u2013target affinity prediction. In: 2021 IEEE international conference on bioinformatics and biomedicine (BIBM): 2021. IEEE. p. 308\u2013313.","DOI":"10.1109\/BIBM52615.2021.9669276"},{"key":"5497_CR23","doi-asserted-by":"crossref","unstructured":"Kao P-Y, Kao S-M, Huang N-L, Lin Y-C. Toward drug\u2013target interaction prediction via ensemble modeling and transfer learning. In: 2021 IEEE international conference on bioinformatics and biomedicine (BIBM): 2021. IEEE. p. 2384\u20132391.","DOI":"10.1109\/BIBM52615.2021.9669729"},{"key":"5497_CR24","first-page":"1243","volume":"10","author":"Z Lingling","year":"2019","unstructured":"Lingling Z, Junjie W, Long P, Yang L, Jun Z. GANsDTA: predicting drug\u2013target binding affinity using GANs. Front Genet. 2019;10:1243.","journal-title":"Front Genet"},{"issue":"11","key":"5497_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/3422622","volume":"63","author":"I Goodfellow","year":"2020","unstructured":"Goodfellow I, Pouget-Abadie J, Mirza M, Xu B, Warde-Farley D, Ozair S, Courville A, Bengio Y. Generative adversarial networks. Commun ACM. 2020;63(11):139\u201344.","journal-title":"Commun ACM"},{"key":"5497_CR26","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1093\/bioinformatics\/btaa921","volume":"37","author":"T Nguyen","year":"2020","unstructured":"Nguyen T, Le H, Quinn TP, Nguyen T, Venkatesh S. GraphDTA: predicting drug\u2013target binding affinity with graph neural networks. Bioinformatics. 2020;37:1140\u20137.","journal-title":"Bioinformatics"},{"issue":"8","key":"5497_CR27","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J. Long short-term memory. Neural Comput. 1997;9(8):1735\u201380.","journal-title":"Neural Comput"},{"issue":"11","key":"5497_CR28","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1038\/nbt.1990","volume":"29","author":"MI Davis","year":"2011","unstructured":"Davis MI, Hunt JP, Herrgard S, Ciceri P, Wodicka LM, Pallares G, Hocker M, Treiber DK, Zarrinkar PP. Comprehensive analysis of kinase inhibitor selectivity. Nat Biotechnol. 2011;29(11):1046\u201351.","journal-title":"Nat Biotechnol"},{"issue":"1","key":"5497_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1021\/ci00057a005","volume":"28","author":"D Weininger","year":"1988","unstructured":"Weininger D. SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules. J Chem Inform Comput Sci. 1988;28(1):31\u20136.","journal-title":"J Chem Inform Comput Sci"},{"key":"5497_CR30","unstructured":"Brody S, Alon U, Yahav E. How attentive are graph attention networks? 2021."},{"key":"5497_CR31","unstructured":"Ramsundar B. Deep learning for the life sciences: applying deep learning to genomics, microscopy, drug discovery, and more. O\u2019Reilly Media, Inc. 2019."},{"issue":"4","key":"5497_CR32","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1093\/biomet\/92.4.965","volume":"92","author":"G Mithat","year":"2005","unstructured":"Mithat G, Glenn H. Concordance probability and discriminatory power in proportional hazards regression. Biometrika. 2005;92(4):965\u201370.","journal-title":"Biometrika"},{"key":"5497_CR33","doi-asserted-by":"crossref","unstructured":"Mukherjee S, Ghosh M, Basuchowdhuri P. Deep graph convolutional network and LSTM based approach for predicting drug\u2013target binding affinity. 2022.","DOI":"10.1137\/1.9781611977172.82"},{"issue":"5","key":"5497_CR34","doi-asserted-by":"publisher","first-page":"bbab117","DOI":"10.1093\/bib\/bbab117","volume":"22","author":"Z Yuni","year":"2021","unstructured":"Yuni Z, Xiangru C, Yujie L, Xuedong L, Dezhong P. Deep drug\u2013target binding affinity prediction with multiple attention blocks. Brief. Bioinform. 2021;22(5):bbab117.","journal-title":"Brief. Bioinform."},{"key":"5497_CR35","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/bioinformatics\/btaa544","volume":"36","author":"A Karim","year":"2020","unstructured":"Karim A, Parvin R, Antti P, Massoud A, Ghasemi JB, Ali MN. DeepCDA: deep cross-domain compound-proteinaffinity prediction through LSTM and convolutional neural networks. Bioinformatics. 2020;36:4633\u201342.","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-023-05497-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-023-05497-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-023-05497-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:21:18Z","timestamp":1730226078000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-023-05497-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["5497"],"URL":"https:\/\/doi.org\/10.1186\/s12859-023-05497-5","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]},"assertion":[{"value":"25 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"367"}}