<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="review-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Pharmacol.</journal-id>
<journal-title>Frontiers in Pharmacology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Pharmacol.</abbrev-journal-title>
<issn pub-type="epub">1663-9812</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1375522</article-id>
<article-id pub-id-type="doi">10.3389/fphar.2024.1375522</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Pharmacology</subject>
<subj-group>
<subject>Review</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A comprehensive review of the recent advances on predicting drug-target affinity based on deep learning</article-title>
<alt-title alt-title-type="left-running-head">Zeng et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fphar.2024.1375522">10.3389/fphar.2024.1375522</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Zeng</surname>
<given-names>Xin</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2638724/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Shu-Juan</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Lv</surname>
<given-names>Shuang-Qing</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wen</surname>
<given-names>Meng-Liang</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1944487/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Li</surname>
<given-names>Yi</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>College of Mathematics and Computer Science</institution>, <institution>Dali University</institution>, <addr-line>Dali</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Yunnan Institute of Endemic Diseases Control and Prevention</institution>, <addr-line>Dali</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Institute of Surveying and Information Engineering West Yunnan University of Applied Science</institution>, <addr-line>Dali</addr-line>, <country>China</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>State Key Laboratory for Conservation and Utilization of Bio-Resources in Yunnan</institution>, <institution>Yunnan University</institution>, <addr-line>Kunming</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/25157/overview">Heike Wulff</ext-link>, University of California, Davis, United States</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1612057/overview">Karim Abbasi</ext-link>, Sharif University of Technology, Iran</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1773018/overview">Zhiqin Zhu</ext-link>, Chongqing University of Posts and Telecommunications, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yi Li, <email>yili@dali.edu.cn</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>02</day>
<month>04</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>15</volume>
<elocation-id>1375522</elocation-id>
<history>
<date date-type="received">
<day>24</day>
<month>01</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>03</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Zeng, Li, Lv, Wen and Li.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Zeng, Li, Lv, Wen and Li</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Accurate calculation of drug-target affinity (DTA) is crucial for various applications in the pharmaceutical industry, including drug screening, design, and repurposing. However, traditional machine learning methods for calculating DTA often lack accuracy, posing a significant challenge in accurately predicting DTA. Fortunately, deep learning has emerged as a promising approach in computational biology, leading to the development of various deep learning-based methods for DTA prediction. To support researchers in developing novel and highly precision methods, we have provided a comprehensive review of recent advances in predicting DTA using deep learning. We firstly conducted a statistical analysis of commonly used public datasets, providing essential information and introducing the used fields of these datasets. We further explored the common representations of sequences and structures of drugs and targets. These analyses served as the foundation for constructing DTA prediction methods based on deep learning. Next, we focused on explaining how deep learning models, such as Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), Transformer, and Graph Neural Networks (GNNs), were effectively employed in specific DTA prediction methods. We highlighted the unique advantages and applications of these models in the context of DTA prediction. Finally, we conducted a performance analysis of multiple state-of-the-art methods for predicting DTA based on deep learning. The comprehensive review aimed to help researchers understand the shortcomings and advantages of existing methods, and further develop high-precision DTA prediction tool to promote the development of drug discovery.</p>
</abstract>
<kwd-group>
<kwd>deep learning</kwd>
<kwd>drug-target affinity</kwd>
<kwd>dataset</kwd>
<kwd>representation</kwd>
<kwd>methods</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Experimental Pharmacology and Drug Discovery</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Drug-target affinity (DTA) is a critical metric and the core of drug discovery. While the wet experiments have been used to calculate DTA with high accuracy, the time-consuming and laborious nature of these experiments can no longer meet the demands of modern drug screening, especially with the massive drug-target pairs. Fortunately, the emergence of computational methods for predicting DTA has accelerated the drug screening process, helping to shorten the drug development cycle and reduce the costs (<xref ref-type="bibr" rid="B25">Kairys et al., 2019</xref>; <xref ref-type="bibr" rid="B2">Abbasi et al., 2021</xref>; <xref ref-type="bibr" rid="B85">Xu et al., 2021</xref>; <xref ref-type="bibr" rid="B93">Zhang et al., 2023a</xref>).</p>
<p>At present, while there are non-machine learning methods available for computing DTA, such as FEP (Free-Energy Perturbation) (<xref ref-type="bibr" rid="B23">Jorgensen and Thomas, 2008</xref>) and MM/GBSA (or MM/PBSA) (<xref ref-type="bibr" rid="B10">&#xc7;&#x131;naro&#x11f;lu and Timu&#xe7;in, 2020</xref>), which can effectively estimate the binding free energy or affinity of drug-target, these methods not only demand a significant amount of computing resources, but also exhibit slow processing speeds when dealing with a large number of drug-target pairs. In contrast, data-driven machine learning methods offer fast processing speeds and high computational accuracy. The computational methods based on machine learning for predicting DTA can be classified into two categories: traditional machine learning methods and deep learning methods. Traditional machine learning methods employ linear regression, random forest regression, nearest neighbor regression, and support vector machine regression (<xref ref-type="bibr" rid="B4">Ballester and Mitchell, 2010</xref>; <xref ref-type="bibr" rid="B34">Li et al., 2015</xref>; <xref ref-type="bibr" rid="B62">Shar et al., 2016</xref>) to predict DTA. Although these methods perform well performance, they cannot automatically extract high-level hidden features from drugs and targets. With the emergence of deep learning models, DTA prediction methods based on deep learning (<xref ref-type="bibr" rid="B52">&#xd6;zt&#xfc;rk et al., 2018</xref>; <xref ref-type="bibr" rid="B75">Wang et al., 2021a</xref>; <xref ref-type="bibr" rid="B60">Rube et al., 2022</xref>) can automatically extract high-level hidden features from the sequences and structures of drugs and targets, resulting in the improved performance compared to traditional machine learning methods. Except for a few methods that utilize deep learning to extract high-level features from target-target and drug-drug interaction networks (<xref ref-type="bibr" rid="B12">Dehghan et al., 2023</xref>; <xref ref-type="bibr" rid="B55">Rafiei et al., 2023</xref>), based on the different combinations of multiple modal features of drugs and targets, such as fingerprints, SMILES, two-dimensional molecular topology graphs, three-dimensional spatial structures, physicochemical properties, sequences, and contact maps, deep learning-based DTA prediction methods can be broadly divided into three categories: sequence-based, hybrid-based, and structure-based methods.</p>
<p>Sequence-based methods (<xref ref-type="bibr" rid="B52">&#xd6;zt&#xfc;rk et al., 2018</xref>; <xref ref-type="bibr" rid="B27">Karimi et al., 2019</xref>; <xref ref-type="bibr" rid="B75">Wang et al., 2021a</xref>; <xref ref-type="bibr" rid="B37">Li et al., 2022b</xref>; <xref ref-type="bibr" rid="B15">Ghimire et al., 2022</xref>; <xref ref-type="bibr" rid="B100">Zhao et al., 2022</xref>; <xref ref-type="bibr" rid="B16">Gim et al., 2023</xref>; <xref ref-type="bibr" rid="B22">Jin et al., 2023</xref>; <xref ref-type="bibr" rid="B26">Kalemati et al., 2023</xref>; <xref ref-type="bibr" rid="B59">Ru et al., 2023</xref>; <xref ref-type="bibr" rid="B102">Zhou et al., 2024</xref>) aim to extract implicit sequence features from drug SMILES (Simplified Molecular Input Line Entry System) (<xref ref-type="bibr" rid="B81">Weininger, 1988</xref>) and target sequences using deep learning models. These methods leverage various sequence deep learning models such as Convolutional Neural Networks (CNNs) (<xref ref-type="bibr" rid="B33">LeCun et al., 2015</xref>), Recurrent Neural Networks (RNNs) (<xref ref-type="bibr" rid="B89">Zaremba et al., 2015</xref>), and Transformers (<xref ref-type="bibr" rid="B73">Vaswani et al., 2017</xref>). In the current sequence-based methods, 1D-CNN, RNNs, and Transformers are commonly used to extract high-level sequence features. On the other hand, 2D-CNN is employed to extract sequence features from a two-dimensional matrix composed of drugs or targets. For instance, DeepDTA (<xref ref-type="bibr" rid="B52">&#xd6;zt&#xfc;rk et al., 2018</xref>) utilized a CNN module with three consecutive 1D convolutional layers to extract sequence features from drug SMILES and target sequences, respectively. SimCNN-DTA (<xref ref-type="bibr" rid="B64">Shim et al., 2021</xref>), on the other hand, employed 2D-CNN to predict DTA by utilizing the outer product between column vectors of two similar matrices representing drugs and targets. While CNNs effectively capture the local features from drug SMILES and target sequences, they may overlook long-range dependencies between atoms or amino acids. To address this issue, RNNs with memory functions can be utilized to extract long-range dependent features, as demonstrated in DeepAffinity (<xref ref-type="bibr" rid="B27">Karimi et al., 2019</xref>) and DeepCDA (<xref ref-type="bibr" rid="B1">Abbasi et al., 2020</xref>). However, CNNs and RNNs may not focus on the key features influencing drug-target interaction or provide interpretability for the model&#x2019;s effectiveness. Some attention mechanisms (<xref ref-type="bibr" rid="B73">Vaswani et al., 2017</xref>) are employed to capture the key features (<xref ref-type="bibr" rid="B91">Zeng et al., 2021</xref>; <xref ref-type="bibr" rid="B7">Chen et al., 2022</xref>; <xref ref-type="bibr" rid="B15">Ghimire et al., 2022</xref>; <xref ref-type="bibr" rid="B49">Monteiro et al., 2022</xref>; <xref ref-type="bibr" rid="B94">Zhang et al., 2022</xref>; <xref ref-type="bibr" rid="B100">Zhao et al., 2022</xref>). For example, AttentionDTA (<xref ref-type="bibr" rid="B100">Zhao et al., 2022</xref>) utilized attention mechanisms to focus on subsequences within drug SMILES and target sequences that played a crucial role in affinity prediction. MRBDTA (<xref ref-type="bibr" rid="B94">Zhang et al., 2022</xref>) incorporated multi-head attention mechanisms, effectively capturing drug-target interaction sites and providing interpretational analysis for its effectiveness. CAPLS (<xref ref-type="bibr" rid="B22">Jin et al., 2023</xref>) employed the cross-attention mechanism to capture the mutual effect of protein-binding pocket and ligand. MT-DTA (<xref ref-type="bibr" rid="B104">Zhu et al., 2023b</xref>) built a variational autoencoders system with a cascade structure of attention model and CNNs to extract the implied high-level interactive features from target sequences and drug SMILES. Sequence-based methods have the advantage of easily obtaining the target sequences and drug SMILES data. These methods excel in processing sequence data swiftly, without demanding substantial computing resources, and exhibit a fine performance in predicting DTA based on the extracted high-level sequence features. Nevertheless, these methods overlook additional multimodal information related to targets and drugs, like topology graphs and 3D structures. It is important to note that structural information harbors crucial features that significantly influence DTA prediction. Disregarding this essential structural data may limit the accuracy, depth, and interpretability of understanding in predicting DTA. However, utilizing the structures of targets to enhance DTA faced limitations in the early states, as only a small portion of target sequences had known structures. Consequently, the exploration of hybrid-based methods emerged by incorporating the structural features of drugs into sequence-based approaches.</p>
<p>Hybrid-based methods (<xref ref-type="bibr" rid="B28">Karimi et al., 2021</xref>; <xref ref-type="bibr" rid="B78">Wang et al., 2021b</xref>; <xref ref-type="bibr" rid="B96">Zhang et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Cheng et al., 2022</xref>; <xref ref-type="bibr" rid="B35">Li et al., 2022a</xref>; <xref ref-type="bibr" rid="B40">Lin et al., 2022a</xref>; <xref ref-type="bibr" rid="B71">Tian et al., 2022</xref>; <xref ref-type="bibr" rid="B87">Yang et al., 2022</xref>; <xref ref-type="bibr" rid="B20">Jiang et al., 2023</xref>; <xref ref-type="bibr" rid="B53">Pan et al., 2023</xref>; <xref ref-type="bibr" rid="B76">Wang et al., 2023a</xref>; <xref ref-type="bibr" rid="B74">Wang and Li, 2023</xref>; <xref ref-type="bibr" rid="B83">Xia et al., 2023</xref>; <xref ref-type="bibr" rid="B86">Yang et al., 2023</xref>; <xref ref-type="bibr" rid="B90">Zeng et al., 2023</xref>; <xref ref-type="bibr" rid="B95">Zhang et al., 2023b</xref>; <xref ref-type="bibr" rid="B93">Zhang et al., 2023a</xref>; <xref ref-type="bibr" rid="B103">Zhu et al., 2023a</xref>; <xref ref-type="bibr" rid="B105">Zhu et al., 2023c</xref>; <xref ref-type="bibr" rid="B50">Nguyen et al., 2022</xref>.) leverage deep learning models to extract sequence features from drug SMILES and target sequences, as well as the structural features from two-dimensional molecular topology graphs and three-dimensional structures of drug small molecules. These methods focus on integrating the structural features of drugs into sequence-based approaches. For the structures of drugs, tools like RDKit (<xref ref-type="bibr" rid="B32">Landrum, 2013</xref>) are commonly used to convert drug SMILES into the molecular graphs. GNN models (<xref ref-type="bibr" rid="B84">Xu et al., 2019</xref>) are employed for capturing the structural features of drugs. For instance, GraphDTA (<xref ref-type="bibr" rid="B51">Nguyen et al., 2021</xref>) utilized GCN and CNN to extract the structural features from drug molecular graphs and sequence features from target sequences, respectively. These extracted features were then combined as inputs and passed through fully connected layers to predict DTA. SAG-DTA (<xref ref-type="bibr" rid="B96">Zhang et al., 2021</xref>) incorporated a GCN with multiple self-attention graph pooling layers to extract the hidden features from drug molecular graphs. CNN was directly applied to the target sequences for learning high-level features. TDGraphDTA (<xref ref-type="bibr" rid="B105">Zhu et al., 2023c</xref>) introduced the transformer and diffusion to predict drug-target interactions using multi-scale information interaction and graph optimization. Hybrid-based methods combine the structural features of drugs with sequence-based approaches, enriching the features of drugs. Typically, GNN are employed to extract the drug structural features from molecular graphs converted from drug SMILES. These molecular graphs are relatively small and have minimal impact on the computational speed of the model. However, three-dimensional structural features of drugs are underutilized in hybrid-based methods. Furthermore, these methods completely overlook the structural features of target and make it difficult to provide explanatory analysis for the effectiveness of the model, leaving ample opportunity for performance enhancement. However, with the advent of AlphaFold (<xref ref-type="bibr" rid="B24">Jumper et al., 2021</xref>) and ColabFold (<xref ref-type="bibr" rid="B29">Kim et al., 2023</xref>), two target structural prediction tools, obtaining target structures has become less challenging. Consequently, there is a growing interest in methods that utilize the structures of drugs and targets for predicting DTA. Structure-based methods are gaining increased attention from researchers in this context.</p>
<p>Structure-based methods (<xref ref-type="bibr" rid="B17">Gomes et al., 2017</xref>; <xref ref-type="bibr" rid="B65">Stepniewska-Dziubinska et al., 2018</xref>; <xref ref-type="bibr" rid="B92">Zhang et al., 2019</xref>; <xref ref-type="bibr" rid="B19">Jiang et al., 2020</xref>; <xref ref-type="bibr" rid="B61">Seo et al., 2021</xref>; <xref ref-type="bibr" rid="B63">Shen et al., 2021</xref>; <xref ref-type="bibr" rid="B41">Lin et al., 2022b</xref>; <xref ref-type="bibr" rid="B45">Ma et al., 2022</xref>; <xref ref-type="bibr" rid="B44">Lu et al., 2023</xref>; <xref ref-type="bibr" rid="B82">Wu et al., 2024</xref>) employ deep learning models like GNN and 3D Convolutional Neural Network (3D-CNN) to extract implicit structural features from the molecular graphs of drugs and targets or the 3D structures of drug-target complexes. Using GNNs (<xref ref-type="bibr" rid="B36">Li et al., 2021</xref>; <xref ref-type="bibr" rid="B88">Yuan et al., 2021</xref>; <xref ref-type="bibr" rid="B9">Chu et al., 2022</xref>; <xref ref-type="bibr" rid="B21">Jiang et al., 2022</xref>; <xref ref-type="bibr" rid="B39">Liao et al., 2022</xref>; <xref ref-type="bibr" rid="B54">Pandey et al., 2022</xref>; <xref ref-type="bibr" rid="B6">Bi et al., 2023</xref>; <xref ref-type="bibr" rid="B79">Wang et al., 2023b</xref>; <xref ref-type="bibr" rid="B98">Zhang et al., 2023d</xref>; <xref ref-type="bibr" rid="B97">Zhang et al., 2023c</xref>; <xref ref-type="bibr" rid="B46">Ma et al., 2023</xref>; <xref ref-type="bibr" rid="B47">Mekni et al., 2023</xref>; <xref ref-type="bibr" rid="B72">Tsui et al., 2023</xref>; <xref ref-type="bibr" rid="B70">Tian et al., 2024</xref>), the molecular graphs of drugs and targets are fed into GNN to obtain the structural features. For example, PSG-BAR (<xref ref-type="bibr" rid="B54">Pandey et al., 2022</xref>) served as an example where a contact map was generated based on the 3D structure of target. Target graph was then constructed using the contact map, and the structural features were extracted using RGAT. For drug, the graph was generated based on its structural file, and RGAT was also employed to extract high-level features. AttentionMGT-DTA (<xref ref-type="bibr" rid="B82">Wu et al., 2024</xref>) represented drugs and targets by a molecular graph and binding pocket graph, respectively. Graph transformer module was utilized to extract the structural features of drugs and binding pockets. WGNN-DTA (<xref ref-type="bibr" rid="B21">Jiang et al., 2022</xref>) constructed protein and molecular graphs through sequence and SMILES that can effectively reflect their structures. Weighted graph neural networks were used to extract the structural features of molecules and proteins for predicting DTA. On the other hand, 3D-CNN-based methods (<xref ref-type="bibr" rid="B101">Zheng et al., 2019</xref>; <xref ref-type="bibr" rid="B31">Kwon et al., 2020</xref>; <xref ref-type="bibr" rid="B42">Liu et al., 2021</xref>; <xref ref-type="bibr" rid="B80">Wang et al., 2022</xref>) directly take the 3D structure of drug-target complex as input and use the extracted spatial features of complex as input for the FC network to predict DTA. For example, AK-Score (<xref ref-type="bibr" rid="B31">Kwon et al., 2020</xref>) employed the ensemble of multiple independently trained networks that consisted of multiple channels of 3D-CNN layers to predict the binding affinity of a complex. Sfcnn (<xref ref-type="bibr" rid="B80">Wang et al., 2022</xref>) converted drug-target complex into 3D grids for CNN training to extract the structural features. Structure-based methods offer effective utilization of the structural features of drugs and targets, yielding impressive performance. They are especially valuable for providing explanatory analyses that shed light on the model&#x2019;s effectiveness, thereby facilitating research into DTA prediction methods and promoting wider application of these models. However, it is important to acknowledge some limitations. One such limitation is the reliance on tools like AlphaFold to obtain the target structures. While AlphaFold has shown higher accuracy in predicting the structures of monomeric proteins, its performance in predicting the structures of other proteins still requires optimization. Additionally, structure-based methods extract structural features from protein structure graphs, which can be computationally demanding and result in slower processing speeds.</p>
<p>In this review, we aimed to highlight the crucial significance of precise DTA prediction, followed by a comprehensive overview of the universal datasets and widely used representation methods for the sequences, structures, and complexes of drugs and targets. We then focused on the widespread application of popular deep learning techniques in DTA prediction. Our goal was to provide a comprehensive overview of datasets, representation, methods, and deep learning techniques for predicting DTA. By doing so, we intend to empower researchers to effectively utilize these resources in developing innovative DTA prediction methods, thereby providing essential support for drug discovery, design, and repurposing endeavors. The main contributions of this review can be summarized as follows:<list list-type="simple">
<list-item>
<p>(1) A comprehensive statistical analysis has been carried out on datasets, representations, model architectures, and performance evaluation of state-of-the-art methods based on deep learning for predicting DTA.</p>
</list-item>
<list-item>
<p>(2) Elaboration on the extraction process of crucial implicit features from diverse modalities of drugs and targets using cutting-edge deep learning technologies like CNN, RNN, GNN, and Transformer.</p>
</list-item>
<list-item>
<p>(3) An in-depth analysis of the strengths and limitations of advanced deep learning methods for predicting DTA is conducted from three perspectives: sequence, hybrid, and structure. This analysis serves as a foundation for researchers to develop novel and more accurate tools for DTA prediction.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s2">
<title>2 Dataset</title>
<p>A high-quality dataset of drug-target binding affinity serves as the fundamental basis for the development of computational methods that leverage deep learning for predicting DTA. Currently, the most widely used datasets for DTA prediction include PDBbind (multiple versions) (<xref ref-type="bibr" rid="B77">Wang et al., 2005</xref>), Davis (<xref ref-type="bibr" rid="B11">Davis et al., 2011</xref>), KIBA (<xref ref-type="bibr" rid="B68">Tang et al., 2014</xref>), BindingDB (<xref ref-type="bibr" rid="B43">Liu et al., 2007</xref>), and Metz (<xref ref-type="bibr" rid="B48">Metz et al., 2011</xref>). To supplement these universal affinity datasets, UniRef (<xref ref-type="bibr" rid="B67">Suzek et al., 2015</xref>), UniProt (<xref ref-type="bibr" rid="B69">The et al., 2021</xref>), Protein Data Bank (PDB) (<xref ref-type="bibr" rid="B5">Berman, 2000</xref>), STITCH (<xref ref-type="bibr" rid="B30">Kuhn et al., 2007</xref>), and ZINC (<xref ref-type="bibr" rid="B18">Irwin and Shoichet, 2006</xref>) can provide additional sequences and structures for drugs and targets that may be missing.</p>
<sec id="s2-1">
<title>2.1 Statistical analysis of commonly used datasets for DTA prediction</title>
<p>We performed a comprehensive statistical analysis on the datasets utilized in nearly 80 references on drug-target affinity cited in this review to assess their usage. The results of our analysis, as depicted in <xref ref-type="fig" rid="F1">Figure 1</xref>, revealed that PDBbind, Davis, KIBA, BindingDB, and Metz were the five most frequently employed datasets. Among these, PDBbind and BindingDB were primarily utilized for deep learning methods based on hybrid or structure. These two datasets offer comprehensive sequence and structural data for drugs and targets. On the other hand, Davis, KIBA, and Metz were predominantly employed for sequence-based deep learning methods, although some hybrid or structure-based deep learning methods also utilized them. It is worth mentioning that the structures of targets in Davis, KIBA, and Metz were sourced from the PDB database.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Statistics on the usage of the datasets for predicting DTA based on deep learning.</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g001.tif"/>
</fig>
</sec>
<sec id="s2-2">
<title>2.2 Introduction to commonly used datasets for DTA prediction</title>
<p>In this section, we provide a detailed introduction to the five most frequently used datasets: PDBbind, Davis, KIBA, BindingDB, and Metz. In addition, we will also introduce the ToxCast dataset (<xref ref-type="bibr" rid="B14">Feng et al., 2019</xref>), which is commonly used in multi-task prediction methods.</p>
<sec id="s2-2-1">
<title>2.2.1 PDBbind</title>
<p>PDBbind dataset comprises four commonly used versions: 2013, 2016, 2018, and 2020. Each version of the dataset consists of two distinct parts: the general set and the refined set (<xref ref-type="table" rid="T1">Table 1</xref>). To illustrate, let&#x2019;s consider the PDBbind dataset (version 2016), which includes a total of 13,283 samples: 9,226 samples for the general set and 4,057 samples for the refined set. The refined set is obtained based on the quality protocols, including measured resolution and experimental precision. This process ensures the exclusion of ligands, ternary complexes, or steric hindrance complexes with resolutions above 2.5&#xa0;&#xc5;, R factors exceeding 0.25, instances of covalent bonding, and complexes lacking reported binding affinities in terms of Kd (dissociation constant) or Ki (inhibitor constant), or falling outside the necessary range (Kd &#x3c; 1&#xa0;pM). Each sample represents a drug-target pair labeled with affinity value known as the dissociation constant (Kd). Notably, each sample provides drug SMILES and target sequence, as well as the 3D structure of target and pocket information related to drug-target binding. Thanks to the extensive sequence and structural information available for drugs, targets, and pockets in PDBbind dataset, it has become widely recognized as a universal dataset for predicting DTA in sequence, hybrid, and structure-based deep learning methods. Furthermore, it is worth mentioning that the CASF series datasets used to test the performance of models in certain studies (<xref ref-type="bibr" rid="B65">Stepniewska-Dziubinska et al., 2018</xref>; <xref ref-type="bibr" rid="B80">Wang et al., 2022</xref>), such as CASF-2013 (<xref ref-type="bibr" rid="B38">Li et al., 2014</xref>), CASF-2016 (<xref ref-type="bibr" rid="B66">Su et al., 2019</xref>), are the core sets derived from the corresponding refined sets of PDBbind datasets.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Statistic of commonly used PDBbind dataset with different versions.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Version</th>
<th align="center">Total number of samples</th>
<th align="center">General set</th>
<th align="center">Refined set</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">2013</td>
<td align="center">11,184</td>
<td align="center">8,225</td>
<td align="center">2,959</td>
</tr>
<tr>
<td align="center">2016</td>
<td align="center">13,283</td>
<td align="center">9,226</td>
<td align="center">4,057</td>
</tr>
<tr>
<td align="center">2018</td>
<td align="center">16,126</td>
<td align="center">11,663</td>
<td align="center">4,463</td>
</tr>
<tr>
<td align="center">2020</td>
<td align="center">19,443</td>
<td align="center">14,127</td>
<td align="center">5,316</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2-2-2">
<title>2.2.2 Davis and KIBA</title>
<p>Davis dataset (<xref ref-type="table" rid="T2">Table 2</xref>) comprises 68 compounds and 442 proteins, generating a total of 30,056 compound-protein affinity samples, each labeled with the dissociation constant (Kd). It is worth noting that all drug-target pairs that can not be experimentally measured for bioactivity are assigned a bioactivity value of 10&#xa0;&#x3bc;M (corresponding to a p<italic>K</italic>
<sub>d</sub> of 5) in Davis dataset. But the number of data points within this range is very large. Consequently, some methods have chosen to remove the data points with a bioactivity value of 10&#xa0;&#x3bc;M from the Davis dataset, thereby creating what is known as the Filtered Davis dataset (<xref ref-type="bibr" rid="B57">Rifaioglu et al., 2021</xref>). KIBA dataset (<xref ref-type="table" rid="T2">Table 2</xref>) includes 246,088 interaction pairs of samples derived from 467 proteins and 52,498 compounds. Notably, KIBA contains three types of labels: inhibition concentration 50 (IC50), dissociation constant (Kd), and inhibition constant (Ki). Due to their focus on only providing the sequences of drugs and targets, Davis and KIBA are predominantly utilized in sequence-based deep learning methods. Nonetheless, a few hybrid or structure-based approaches have also been successfully employed using these datasets. It is important to note that while Davis and KIBA do not include the 3D structures of targets and drugs, they can be accessed by downloading them from the PDB and ZINC databases, respectively.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Detailed information on datasets Davis, Filtered Davis, and KIBA.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Dataset</th>
<th align="center">Compounds</th>
<th align="center">Proteins</th>
<th align="center">Total number of samples</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Davis</td>
<td align="center">68</td>
<td align="center">442</td>
<td align="center">30,056</td>
</tr>
<tr>
<td align="center">Filtered Davis</td>
<td align="center">68</td>
<td align="center">379</td>
<td align="center">9,125</td>
</tr>
<tr>
<td align="center">KIBA</td>
<td align="center">52,498</td>
<td align="center">467</td>
<td align="center">246,088</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2-2-3">
<title>2.2.3 BindingDB</title>
<p>BindingDB dataset is primarily composed of drug-target pair samples sourced from some scientific literatures, encompassing four different types of affinity labels: IC50, Kd, Ki, and EC50 (median effect concentration). <xref ref-type="table" rid="T3">Table 3</xref> displays the number of drugs, targets, and drug-target interaction pairs in each label category. Notably, BindingDB provides drug SMILES and target sequences, while their structures can be obtained from PDB and ZINC databases, respectively. This comprehensive information enables BindingDB to be widely utilized in sequence, hybrid, and structure-based methods, typically to evaluate the generalization performance of DTA prediction methods.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Details of BindingDB dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Dataset</th>
<th align="center">Label</th>
<th align="center">Drugs</th>
<th align="center">Targets</th>
<th align="center">Total number of samples</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="4" align="center">BindingDB</td>
<td align="center">IC50</td>
<td align="center">265,627</td>
<td align="center">2,793</td>
<td align="center">376,751</td>
</tr>
<tr>
<td align="center">Kd</td>
<td align="center">5,895</td>
<td align="center">812</td>
<td align="center">12,589</td>
</tr>
<tr>
<td align="center">Ki</td>
<td align="center">93,437</td>
<td align="center">1,619</td>
<td align="center">144,525</td>
</tr>
<tr>
<td align="center">EC50</td>
<td align="center">31,970</td>
<td align="center">513</td>
<td align="center">37,896</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2-2-4">
<title>2.2.4 Metz</title>
<p>Metz dataset comprises 1,423 drugs and 170 targets, resulting in a total of 35,259 drug-target pairs. Each pair is labeled with an affinity value represented by Ki (in the form of p<italic>K</italic>
<sub>i</sub> value). Furthermore, the relationship between drugs and targets can be accessed from the STITCH database, which consolidates diverse chemical and protein networks.</p>
</sec>
<sec id="s2-2-5">
<title>2.2.5 ToxCast</title>
<p>Toxcast is a toxicology research dataset derived from high-throughput <italic>in vitro</italic> screening of chemicals, primarily measuring AC50, which represents the concentration at half of the maximum activity. This dataset has a large scale, covering different types of proteins, and contains qualitative results from more than 600 experiments involving over 8,000 compounds. With around 530,000 observations of drug-target pairs and over 600 labels, it is well-suited for multi-task prediction. Its subsets are frequently utilized for case studies or generalization performance testing of DTA methods.</p>
</sec>
</sec>
<sec id="s2-3">
<title>2.3 Introduction to supplementary used databases for DTA prediction</title>
<sec id="s2-3-1">
<title>2.3.1 Uniprot</title>
<p>Uniprot database (<xref ref-type="bibr" rid="B69">The et al., 2021</xref>) is a sequence database designed specifically for proteins that contains approximately 220 million protein sequences and related annotation information on the biological functions of proteins. It has the ability to add new protein entries, as well as supplement and update publicly available annotation information, and is widely regarded as the protein database with the most extensive collection and comprehensive annotation information.</p>
</sec>
<sec id="s2-3-2">
<title>2.3.2 PDB</title>
<p>PDB database (<xref ref-type="bibr" rid="B5">Berman, 2000</xref>) is the premier collection of 3D structures for biological macromolecules, such as proteins, nucleic acids, etc., which contains the 3D structures of all resolved proteins. In addition to annotating the 3D structural information of proteins, PDB also provides various file types for downloading and visualizing the 3D structures of proteins.</p>
</sec>
<sec id="s2-3-3">
<title>2.3.3 STITCH</title>
<p>STITCH database (<xref ref-type="bibr" rid="B30">Kuhn et al., 2007</xref>) is a valuable resource that includes information on interactions between 43,000 compounds and 9,643,763 proteins from 2,031 species. It shares protein interaction data with the STRING database (<ext-link ext-link-type="uri" xlink:href="https://cn.string-db.org/">https://cn.string-db.org/</ext-link>), making it an important database for studying compound sequences. Each interaction in STITCH database is assigned a score value, which represents the affinity or probability of the interaction between a compound and a protein. STITCH also provides information on compounds that are similar to the drug of target, along with their similarity scores.</p>
</sec>
<sec id="s2-3-4">
<title>2.3.4 ZINC</title>
<p>ZINC (<xref ref-type="bibr" rid="B18">Irwin and Shoichet, 2006</xref>) is a free commercial database used for virtual screening of compounds, which provides access to 3D structures of over 230 million molecules. It offers multiple docking program interfaces, user-defined molecular operations, and web-based database search and browsing capabilities.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3 Representation</title>
<sec id="s3-1">
<title>3.1 Sequence representation</title>
<p>Drug SMILES and target sequences are composed of different characters. Therefore, they are commonly encoded using one-hot encoding or label encoding in sequence and hybrid-based methods. Their sequence features are extracted using CNN, RNN, or Transformer. In structure-based methods, the extracted features from sequences are utilized as node features in the graphs of drugs and targets. In addition, traditional sequence features such as molecular fingerprint, position-specific score matrix (PSSM) (<xref ref-type="bibr" rid="B3">Altschul, 1997</xref>), and Hidden Markov Matrix (HMM) (<xref ref-type="bibr" rid="B56">Remmert et al., 2012</xref>) are also widely employed in DTA prediction.</p>
</sec>
<sec id="s3-2">
<title>3.2 Structure representation</title>
<p>For drug, the structure representation often involves graph. One common type of the drug graph is based on the drug SMILES, which can be converted using RDKit tool. Another type of the drug graph is based on the 3D structural file, where atoms serve as vertices and bonds act as edges. Node features in the drug graph can be derived from the physical-chemical properties of atoms or extracted from drug SMILES using deep learning techniques.</p>
<p>For target, the secondary structural information can be obtained directly from the relevant file of target and is widely employed in traditional machine learning and deep learning methods. The tertiary structural graph of target can be roughly categorized into two types: contact map and spatial topology graph. Contact map is created based on the sequence or tertiary structure of target, generating a map of interaction between amino acids. Structural features of target can be extracted directly from the contact map using CNN models. Alternatively, the contact map can be converted into a target graph, allowing the use of GNNs to extract structural features. Spatial topology graph of target is constructed based on the 3D structural file. Nodes in the graph represent amino acids, typically carbon <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> atoms, and edges are formed based on distance thresholds, such as Euclidean distance between carbon <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> atoms.</p>
</sec>
<sec id="s3-3">
<title>3.3 Interaction network graph representation of drug-target complex</title>
<p>In DTA prediction, the interaction between a drug and its target is often represented as a graph. This involves extracting interaction features using GNN. The construction of the interaction network graph is based on the 3D structure of drug-target complex. To create the graph, the atoms of drug and the carbon atom of amino acid in target (typically the carbon <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> atom) are selected as the vertices of graph. The Euclidean distance between each atom and the carbon atom is then calculated. If the distance is less than or equal to a specified threshold (usually set to 8&#xa0;&#xc5; or 10&#xa0;&#xc5;), an edge is created to connect the corresponding atom to the amino acid. Any atoms and amino acids that did not participate in the construction of the interaction graph are excluded. This process results in an interaction network graph that represents the drug-target complex, which can be used for analysis and prediction of DTA.</p>
</sec>
<sec id="s3-4">
<title>3.4 3D structural spatial grid representation of drug-target complex</title>
<p>While the interaction network graph of drug-target complex can provide valuable information about the structural features, some atoms and amino acids are ignored. As a result, deep learning methods that utilize a complete 3D structural spatial grid representation of drug-target complex are widely used. The 3D structural spatial grid representation of the complex is composed of the spatial coordinates of all atoms, and 3D-CNN is used to extract the spatial structural features from the complex&#x2019;s 3D structure.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Drug-target affinity prediction methods based on deep learning</title>
<p>Currently, computational methods for predicting DTA using deep learning can be broadly categorized into three groups based on the progression from sequence to structure: sequence-based, hybrid-based, and structure-based methods. In the following chapters, we will provide a comprehensive overview of the feature extraction process for each category.</p>
<sec id="s4-1">
<title>4.1 Sequence-based deep learning methods</title>
<p>Sequence-based deep learning methods (<xref ref-type="fig" rid="F2">Figure 2</xref>) utilize drug SMILES and target sequences as input. These methods employ various deep learning techniques, including CNN, RNN, Transformer, and attention mechanisms, to extract essential features from the input sequences. In the following sections, we will provide an overview of some classic sequence-based methods.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>The overview architecture of sequence-based deep learning methods for predicting DTA.</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g002.tif"/>
</fig>
<sec id="s4-1-1">
<title>4.1.1 DeepDTA</title>
<p>In DeepDTA (<xref ref-type="bibr" rid="B52">&#xd6;zt&#xfc;rk et al., 2018</xref>), drug SMILES and target sequences were encoded as label encodings and used as inputs. The sequence feature extraction was conducted by two independent CNN blocks, each comprising three 1D convolutional layers. Drug SMILES and target sequences, were separately processed through the embedded layers and passed into their respective CNN blocks. This allowed for the extraction of high-level sequence features from drugs and targets. Subsequently, the extracted sequence features were concatenated and fed into a three-layer FC network to predict DTA. DeepDTA not only showed superior performance compared to traditional machine learning methods, but also enabled automatic extraction of sequence features and end-to-end DTA prediction. This contributed to the transition from traditional machine learning methods to deep learning methods in the field of DTA prediction.</p>
</sec>
<sec id="s4-1-2">
<title>4.1.2 DeepCDA</title>
<p>In the architecture of DeepCDA (<xref ref-type="bibr" rid="B1">Abbasi et al., 2020</xref>), drug SMILES and target sequences were used as inputs. Initially, both drug SMILES and target sequences underwent encoding via coding layers. The encoded representations were then separately fed into identical feature extraction networks. Each feature extraction network consisted of two components: a CNN block and an LSTM block. CNN block comprised three convolutional layers, responsible for extracting short-distance features from the sequences. These short-distance features were subsequently inputted into a multi-layer LSTM block to capture long-distance dependent features. By combining CNN and LSTM, DeepCDA effectively considered local and long-range dependent features of the sequence. To further extract crucial information influencing drug-target interaction, a bidirectional attention mechanism was employed to fuse the extracted sequence features. This fusion process enabled comprehensive feature mining that accounts for the interaction between drugs and targets. Finally, the fused features were fed into a FC layer to predict DTA.</p>
</sec>
<sec id="s4-1-3">
<title>4.1.3 AttentionDTA</title>
<p>AttentionDTA (<xref ref-type="bibr" rid="B100">Zhao et al., 2022</xref>) took drug SMILES and target sequences as input, which were encoded using label encoding. A character embedding layer was inserted between the label encoding layer and the feature extraction block to convert drug SMILES and target sequences into embedding matrices. These matrices were then passed through a CNN block consisting of multiple 1D-CNN layers to extract implicit sequence features. To capture the non-covalent interactions between the atoms of drug and the amino acids of target, AttentionDTA incorporated a bilateral multi-head attention mechanism. This mechanism took the features extracted by the CNN block as input, allowing it to capture the interaction information that affected drug-target interaction. The resulting key interaction information was subsequently fed into a multi-layer perceptron (MLP) for DTA prediction.</p>
</sec>
</sec>
<sec id="s4-2">
<title>4.2 Hybrid-based deep learning methods</title>
<p>Hybrid-based deep learning methods (<xref ref-type="fig" rid="F3">Figure 3</xref>) have been at the forefront of utilizing the structural features of drugs. The process begins by obtaining the graph representation of drug directly from its SMILES using RDKit tool. Subsequently, GNN is employed to learn implicit high-level structural features from the graph. Finally, these extracted structural features are combined with the sequence features of target to predict DTA. These methods effectively integrate the sequence and structural information to enhance the performance.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>The overview architecture of hybrid-based deep learning methods for predicting DTA.</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g003.tif"/>
</fig>
<sec id="s4-2-1">
<title>4.2.1 GraphDTA</title>
<p>GraphDTA (<xref ref-type="bibr" rid="B51">Nguyen et al., 2021</xref>) was a representative hybrid-based deep learning method for predicting DTA. It leveraged the structural features of drugs and the sequence features of targets. Initially, drug SMILES was converted into a molecular graph using the RDKit tool. Subsequently, a three-layer GNN was employed to extract the structural features. As for target, the sequence underwent label encoding and embedding layers before being inputted into a convolutional block comprising three 1D-CNN layers to learn sequence features. Finally, the extracted structural features of drugs and the sequence features of targets were combined and fed into a FC network with multiple layers to estimate DTA.</p>
</sec>
<sec id="s4-2-2">
<title>4.2.2 MGraphDTA</title>
<p>MGraphDTA (<xref ref-type="bibr" rid="B87">Yang et al., 2022</xref>) took a similar approach by leveraging the structures of drugs and target sequences. However, it enhanced the global structural features extraction by employing a deeper multi-scale GNN (MGNN). This allowed for a comprehensive understanding of the global relationships between atoms in drug and captured various features within the structure of drug. Simultaneously, multi-scale CNN (MCNN) was applied to extract multi-scale features from target sequences. Following this, the multi-scale features from the structures of drugs and target sequences were separately fused, and the resulting fused features were concatenated to form a combined representation of drug-target pair. Finally, the combined representation was fed into MLP to predict DTA.</p>
</sec>
<sec id="s4-2-3">
<title>4.2.3 ColdDTA</title>
<p>Deep learning methods have exhibited promising performance on randomly split public datasets, but their performance tends to significantly decrease when applied to practical scenarios. To address this issue, ColdDTA (<xref ref-type="bibr" rid="B13">Fang et al., 2023</xref>) utilized the structural knowledge of drugs and target sequence information to enhance the model&#x2019;s generalization performance by data augmentation and attention-based feature fusion techniques. The construction process of ColdDTA was as follows: firstly, a new drug-target pair was generated by removing a subgraph from the original graph of drug. Next, the structural features of drug and the sequence features of target were extracted using GNN and CNN, respectively. These extracted features were then fused via an attention-based fusion block to better capture the interaction mechanism between drug and target. Finally, the fused features were inputted into MLP to predict DTA.</p>
</sec>
</sec>
<sec id="s4-3">
<title>4.3 Structure-based deep learning methods</title>
<p>Currently, structure-based deep learning methods for predicting DTA can be broadly categorized into two types. The first type involves extracting structural features from the molecular graphs of drugs and targets using GNN, followed by fusing the extracted features to predict DTA using a FC network (<xref ref-type="fig" rid="F4">Figure 4A</xref>). The second type is based on 3D structures of drug-target complexes, where high-level structural features are extracted using 3D-CNN to predict DTA (<xref ref-type="fig" rid="F4">Figure 4B</xref>). With the emergence of AlphaFold and ColabFold, obtaining the structures of targets has become more feasible. Furthermore, the rapid development of GNN and 3D-CNN has provided critical support for extracting structural features. As a result, structure-based methods have garnered increasing attention from researchers.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>The overview architecture of structure-based deep learning methods. <bold>(A)</bold> The extraction of structural features from molecular graphs of drugs and targets using Graph Neural Networks (GNN), and <bold>(B)</bold> the extraction of structural features of drug-target complexes from their 3D structures using 3D Convolutional Neural Networks (3D-CNN).</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g004.tif"/>
</fig>
<sec id="s4-3-1">
<title>4.3.1 GSAML-DTA</title>
<p>GSAML-DTA (<xref ref-type="bibr" rid="B39">Liao et al., 2022</xref>) employed a hybrid network model combining GNN and GAT to extract structural features from drugs and targets. The process began by converting drug SMILES and target sequences into drug molecular graphs and contact maps, respectively, using different tools. Subsequently, drug molecular graphs and contact maps were separately inputted into the hybrid network model of GNN-GAT with an attention mechanism to extract structural features of drugs and targets. Following this, the extracted features were concatenated and further optimized through an interactive information module. Finally, the optimized features were fed into a FC network to predict DTA. By leveraging the GNN-GAT hybrid network model with attention mechanism and the interactive module, GSAML-DTA aimed to enhance the accuracy of DTA prediction.</p>
</sec>
<sec id="s4-3-2">
<title>4.3.2 HGRL-DTA</title>
<p>HGRL-DTA (<xref ref-type="bibr" rid="B9">Chu et al., 2022</xref>) utilized a hierarchical graph representation learning model for predicting DTA. This model established a hierarchical graph framework where the drug-target binding affinity data was represented as an affinity graph, with drugs and targets serving as vertices within the graph. Simultaneously, drugs and targets were represented as molecular graphs, respectively. To begin, GNN was employed to learn global-level affinity relationship within the affinity graph. Additionally, GNN was also used to separately capture the local chemical structural features of drugs and targets. Through a message propagation mechanism, the learned hierarchical graph information was integrated, and the structural features of drugs and targets were refined using GCN. Finally, these extracted structural features of drugs and targets were combined and inputted into a FC network to predict DTA. By leveraging the hierarchical graph setup, GNN-based representation learning, and message propagation mechanism, HGRL-DTA aimed to improve the accuracy of DTA prediction.</p>
</sec>
<sec id="s4-3-3">
<title>4.3.3 MSGNN-DTA</title>
<p>MSGNN-DTA (<xref ref-type="bibr" rid="B79">Wang et al., 2023b</xref>) employed a multi-scale graph construction approach to capture the structural features of drugs and targets from multiple perspectives. For drugs, two types of graphs were constructed. Firstly, an atomic level graph was generated using RDKit tool based on drug SMILES. In this graph, atoms were represented as vertices, chemical bonds between atoms were represented as edges, and the topology was represented by a two-dimensional matrix. Secondly, a motif level graph was created by considering certain motifs (e.g., benzene rings) as vertices, with edges indicating the presence of chemical bond connections between motifs. Regarding target, target sequence was converted into a contact map using ESM-1b (<xref ref-type="bibr" rid="B58">Rives et al., 2021</xref>). Additionally, a weight map was constructed based on WGNN-DTA (<xref ref-type="bibr" rid="B21">Jiang et al., 2022</xref>). In weight map, residues served as vertices, interactions between residues served as edges, and weights of edges were probability values. To obtain multi-scale topological feature representations, GNN was utilized to extracted high-level structural features from the atomic level graphs and motif level graphs of drugs, as well as the weight graphs of targets. Subsequently, an attention mechanism was employed to fuse the multi-scale structural features and generate a join feature representation. The joint feature representation was then inputted into a multi-layer FC network for DTA prediction.</p>
</sec>
<sec id="s4-3-4">
<title>4.3.4 Sfcnn</title>
<p>Aside from utilizing GNN to extract the structural features from molecular graphs of drugs and targets, there are some methods that use 3D-CNN to extract the structural features from drug-target complexes. One such method was Sfcnn, which employed 3D-CNN to generate a score function for DTA prediction. To begin, the drug-target complex was transformed into a 3D grid representation. This grid served as input to 3D-CNN, which learned high-level structural features. Finally, multiple density layers were applied to the extracted features for DTA prediction.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<title>5 Performance analysis of multiple state-of-the-art methods based on deep learning</title>
<sec id="s5-1">
<title>5.1 Common performance evaluation metrics</title>
<p>In this review, predicting drug-target affinity is a regression task, and commonly used performance evaluation metrics of the model include Mean Absolute Error (<italic>MAE</italic>), Mean Square Error (<italic>MSE</italic>), Root Mean Square Error (<italic>RMSE</italic>), Pearson Correlation Coefficient (<italic>PCC</italic>), Spearman (<inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:mi>&#x3c1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>), Concordance Index (<italic>CI</italic>), and <italic>R</italic>
<sup>2</sup>.</p>
<p>
<italic>MAE</italic> Eq. <xref ref-type="disp-formula" rid="e1">1</xref> is used to measure the mean absolute error between prediction value and actual value. It reflects the size of actual prediction error.<disp-formula id="e1">
<mml:math id="m5">
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2b;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>
<italic>MSE</italic> Eq. <xref ref-type="disp-formula" rid="e2">2</xref> and <italic>RMSE</italic> Eq. <xref ref-type="disp-formula" rid="e3">3</xref> are often used to measure the deviation between prediction value and actual value. It is a measure of accuracy used to compare the prediction errors of different models for specific dataset and measure the error rate of the regression model. For <italic>MAE</italic>, <italic>MSE</italic>, and <italic>RMSE</italic>, the smaller their values are, the better effect of the model is.<disp-formula id="e2">
<mml:math id="m6">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<disp-formula id="e3">
<mml:math id="m7">
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:msqrt>
<mml:mo>,</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2b;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<p>
<inline-formula id="inf5">
<mml:math id="m8">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> Eq. <xref ref-type="disp-formula" rid="e4">4</xref> is mainly used to measure how well the prediction value fits the actual value. When our model does not have any deficiencies, <inline-formula id="inf6">
<mml:math id="m9">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> will get the maximum value of 1. If <inline-formula id="inf7">
<mml:math id="m10">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is 0, our model is equal to the baseline model. When <inline-formula id="inf8">
<mml:math id="m11">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is less than 0, it means that our model is not as good as the baseline model.<disp-formula id="e4">
<mml:math id="m12">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>In formula Eqs <xref ref-type="disp-formula" rid="e1">1</xref>&#x2013;<xref ref-type="disp-formula" rid="e4">4</xref>, <inline-formula id="inf9">
<mml:math id="m13">
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the number of samples, <inline-formula id="inf10">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the vector of actual value, <inline-formula id="inf11">
<mml:math id="m15">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the precdition vector, and <inline-formula id="inf12">
<mml:math id="m16">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the average value of all actual values <inline-formula id="inf13">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>
<italic>PCC</italic> Eq. <xref ref-type="disp-formula" rid="e5">5</xref> is used to measure the mutual relationship (linear correlation) between two variables <italic>X</italic> and <italic>Y</italic>, and its range is [&#x2212;1, 1]. <italic>PCC</italic> is widely used in academic research to measure the strength of the linear correlation between two variables. <italic>Cov</italic> (<italic>X</italic>, <italic>Y</italic>) represents the covariance of two variables <italic>X</italic> and <italic>Y</italic>. <inline-formula id="inf14">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the standard deviation of <italic>X</italic>. If <inline-formula id="inf15">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, it means that <italic>X</italic> and <italic>Y</italic> are positively correlated; <inline-formula id="inf16">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <italic>X</italic> and <italic>Y</italic> are negatively correlated; <inline-formula id="inf17">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <italic>X</italic> and <italic>Y</italic> are not correlated.<disp-formula id="e5">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>X</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>Y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>Spearman Eq. <xref ref-type="disp-formula" rid="e6">6</xref> is a nonparametric measure of the dependence of two variables. <inline-formula id="inf18">
<mml:math id="m23">
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the number of samples. The difference between prediction value and actual value of each group is <inline-formula id="inf19">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. The closer value of correlation coefficient <inline-formula id="inf20">
<mml:math id="m25">
<mml:mrow>
<mml:mi>&#x3c1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is to &#x2b;1 or &#x2212;1, the stronger correlation between two variables.<disp-formula id="e6">
<mml:math id="m26">
<mml:mrow>
<mml:mi>&#x3c1;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>6</mml:mn>
<mml:mo>&#x2211;</mml:mo>
<mml:msubsup>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>
<italic>CI</italic> Eq. <xref ref-type="disp-formula" rid="e7">7</xref> is used to evaluate the prediction accuracy of the model. Where <inline-formula id="inf21">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the prediction value for the larger affinity <inline-formula id="inf22">
<mml:math id="m28">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf23">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the prediction value for the smaller affinity <inline-formula id="inf24">
<mml:math id="m30">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, Z is a normalization constant. For function <inline-formula id="inf25">
<mml:math id="m31">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, it is 1 if the value of <italic>x</italic> is greater than 0, 0.5 if the value of <italic>x</italic> is equal to 0, and 0 if the value of <italic>x</italic> is less than 0.<disp-formula id="e7">
<mml:math id="m32">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>I</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>Z</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
</sec>
<sec id="s5-2">
<title>5.2 Performance analysis of multiple state-of-the-art methods based on PDBbind, KIBA, and Davis datasets</title>
<p>
<xref ref-type="fig" rid="F1">Figure 1</xref> highlights PDBbind, KIBA, and Davis datasets as commonly used datasets for predicting DTA using deep learning. We summarized the performance evaluation metrics values of several state-of-the-art methods on PDBbind, KIBA, and Davis datasets, as reported in recently published literatures (<xref ref-type="bibr" rid="B76">Wang et al., 2023a</xref>; <xref ref-type="bibr" rid="B103">Zhu et al., 2023a</xref>; <xref ref-type="bibr" rid="B6">Bi et al., 2023</xref>; <xref ref-type="bibr" rid="B83">Xia et al., 2023</xref>; <xref ref-type="bibr" rid="B70">Tian et al., 2024</xref>; <xref ref-type="bibr" rid="B82">Wu et al., 2024</xref>; <xref ref-type="bibr" rid="B102">Zhou et al., 2024</xref>), without considering the specific partitioning of the corresponding datasets by these methods. Although the statistical results (<xref ref-type="table" rid="T4">Tables 4</xref>, <xref ref-type="table" rid="T5">5</xref>; <xref ref-type="fig" rid="F5">Figures 5</xref>&#x2013;<xref ref-type="fig" rid="F7">7</xref>) showed that these methods have achieved good prediction performance for DTA on commonly used benchmark datasets, the further improvement in DTA prediction still faces challenges. Researchers are actively working on extracting high-level implicit features from the sequences, structures, or complexes of drugs and targets, with the aim of developing novel methods with even better performance for predicting DTA.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Performance comparison of multiple state-of-the-art methods based on PDBbind dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Methods</th>
<th align="center">MSE</th>
<th align="center">RMSE</th>
<th align="center">CI</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Pafnucy</td>
<td align="center">1.418</td>
<td align="center">1.129</td>
<td align="center">0.789</td>
</tr>
<tr>
<td align="center">DeepDTA</td>
<td align="center">1.443</td>
<td align="center">1.148</td>
<td align="center">0.771</td>
</tr>
<tr>
<td align="center">DeepDTAF</td>
<td align="center">1.355</td>
<td align="center">1.073</td>
<td align="center">0.799</td>
</tr>
<tr>
<td align="center">FusionDTA</td>
<td align="center">1.504</td>
<td align="center">1.2</td>
<td align="center">0.766</td>
</tr>
<tr>
<td align="center">DataDTA</td>
<td align="center">1.274</td>
<td align="center">1.012</td>
<td align="center">0.806</td>
</tr>
<tr>
<td align="center">GraphDTA</td>
<td align="center">1.579</td>
<td align="center">1.193</td>
<td align="center">0.66</td>
</tr>
<tr>
<td align="center">WideDTA</td>
<td align="center">1.633</td>
<td align="center">1.295</td>
<td align="center">0.638</td>
</tr>
<tr>
<td align="center">DeepGS</td>
<td align="center">1.385</td>
<td align="center">1.096</td>
<td align="center">0.784</td>
</tr>
<tr>
<td align="center">DeepFusionDTA</td>
<td align="center">1.235</td>
<td align="center">1.203</td>
<td align="center">0.774</td>
</tr>
<tr>
<td align="center">AffinityVAE</td>
<td align="center">1.398</td>
<td align="center">1.102</td>
<td align="center">0.792</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>Performance comparison of multiple state-of-the-art methods based on KIBA and Davis datasets.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Dataset</th>
<th align="center">Methods</th>
<th align="center">MSE</th>
<th align="center">CI</th>
<th align="center">Methods</th>
<th align="center">MSE</th>
<th align="center">CI</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="5" align="center">KIBA</td>
<td align="center">GanDTI</td>
<td align="center">0.469</td>
<td align="center">0.878</td>
<td align="center">DGraphDTA</td>
<td align="center">0.127</td>
<td align="center">0.902</td>
</tr>
<tr>
<td align="center">GraphDTA</td>
<td align="center">0.441</td>
<td align="center">0.881</td>
<td align="center">HiSIF-DTA</td>
<td align="center">0.12</td>
<td align="center">0.904</td>
</tr>
<tr>
<td align="center">WGNNDTA</td>
<td align="center">0.43</td>
<td align="center">0.886</td>
<td align="center">GTAMP-DTA</td>
<td align="center">0.123</td>
<td align="center">0.917</td>
</tr>
<tr>
<td align="center">MGraphDTA</td>
<td align="center">0.427</td>
<td align="center">0.889</td>
<td align="center">TransVAE-DTA</td>
<td align="center">0.2536</td>
<td align="center">0.8221</td>
</tr>
<tr>
<td align="center">UCMCDTA</td>
<td align="center">0.421</td>
<td align="center">0.891</td>
<td align="center">AttentionMGT-DTA</td>
<td align="center">0.14</td>
<td align="center">0.893</td>
</tr>
<tr>
<td rowspan="5" align="center">Davis</td>
<td align="center">GanDTI</td>
<td align="center">0.236</td>
<td align="center">0.885</td>
<td align="center">DGraphDTA</td>
<td align="center">0.202</td>
<td align="center">0.905</td>
</tr>
<tr>
<td align="center">GraphDTA</td>
<td align="center">0.225</td>
<td align="center">0.895</td>
<td align="center">HiSIF-DTA</td>
<td align="center">0.191</td>
<td align="center">0.907</td>
</tr>
<tr>
<td align="center">WGNNDTA</td>
<td align="center">0.211</td>
<td align="center">0.898</td>
<td align="center">GTAMP-DTA</td>
<td align="center">0.177</td>
<td align="center">0.923</td>
</tr>
<tr>
<td align="center">MGraphDTA</td>
<td align="center">0.205</td>
<td align="center">0.899</td>
<td align="center">TransVAE-DTA</td>
<td align="center">0.3229</td>
<td align="center">0.8596</td>
</tr>
<tr>
<td align="center">UCMCDTA</td>
<td align="center">0.203</td>
<td align="center">0.9</td>
<td align="center">AttentionMGT-DTA</td>
<td align="center">0.193</td>
<td align="center">0.891</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Performance analysis of multiple state-of-the-art methods based on PDBbind dataset. The general set and refined set are used as the training dataset, while the core set serves as the test dataset. The evaluation metric values of these methods in the figure are sourced from References (<xref ref-type="bibr" rid="B76">Wang et al., 2023a</xref>; <xref ref-type="bibr" rid="B103">Zhu et al., 2023a</xref>).</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Performance analysis of multiple state-of-the-art methods based on KIBA dataset. The evaluation metric values of these methods in the figure are sourced from References (<xref ref-type="bibr" rid="B6">Bi et al., 2023</xref>; <xref ref-type="bibr" rid="B83">Xia et al., 2023</xref>; <xref ref-type="bibr" rid="B70">Tian et al., 2024</xref>; <xref ref-type="bibr" rid="B82">Wu et al., 2024</xref>; <xref ref-type="bibr" rid="B102">Zhou et al., 2024</xref>).</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Performance analysis of multiple state-of-the-art methods based on Davis dataset. The evaluation metric values of these methods in the figure are sourced from References (<xref ref-type="bibr" rid="B6">Bi et al., 2023</xref>; <xref ref-type="bibr" rid="B83">Xia et al., 2023</xref>; <xref ref-type="bibr" rid="B70">Tian et al., 2024</xref>; <xref ref-type="bibr" rid="B82">Wu et al., 2024</xref>; <xref ref-type="bibr" rid="B102">Zhou et al., 2024</xref>).</p>
</caption>
<graphic xlink:href="fphar-15-1375522-g007.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="conclusion" id="s6">
<title>6 Conclusion</title>
<p>Deep learning-based computational methods for DTA prediction have become a crucial component of drug discovery in the pharmaceutical industry. Despite the significant progress achieved by these methods, there is still a gap between their current prediction accuracy and the expectations of researchers. Therefore, to further facilitate the development of novel and high-precision computational methods for DTA prediction, this review provides detailed statistics, summaries, and elaboration on commonly used datasets, the sequence and structural representations of drugs and targets, as well as representative deep learning methods.</p>
<p>From the comprehensive overview of advanced methods for predicting DTA based on deep learning, three key points stand out:<list list-type="simple">
<list-item>
<p>1. It is essential to thoughtfully combine deep learning models like CNN, RNN, and GNN to extract crucial implicit features influencing DTA prediction from the sequences, structures, and other data related to drugs and targets.</p>
</list-item>
<list-item>
<p>2. Deep learning models are employed to extract numerous features from diverse modalities of drugs and targets. Further refinement and effective fusion of these features are vital to obtain comprehensive deep features.</p>
</list-item>
<list-item>
<p>3. Most DTA prediction methods using deep learning lack explanations of their effectiveness. This absence hinders researchers from enhancing current methods.</p>
</list-item>
</list>
</p>
<p>In the future, it is imperative to delve into DTA prediction methods based on deep learning from three key perspectives:<list list-type="simple">
<list-item>
<p>1. Alongside commonly used deep learning models like CNN, RNN, and GNN, it is essential to incorporate unsupervised learning models such as contrastive learning to comprehensively capture the pivotal features influencing DTA prediction.</p>
</list-item>
<list-item>
<p>2. The emergence of tools such as AlphaFold has made it no longer difficult to obtain the structures of targets, with these structures playing a crucial role in determining molecular function. Hence, delving deeper into the three-dimensional spatial structural features of drugs and targets will help enhance the performance of DTA prediction.</p>
</list-item>
<list-item>
<p>3. While some deep learning-based methods for DTA prediction have shown promising results on standard datasets, their generalization performance is not satisfactory. Therefore, focusing on selecting specific datasets within particular fields and constructing deep learning models for DTA prediction that directly cater to practical application requirements will emerge as a prominent area of research interest.</p>
</list-item>
</list>
</p>
</sec>
</body>
<back>
<sec id="s7">
<title>Author contributions</title>
<p>XZ: Writing&#x2013;original draft. S-JL: Investigation, Supervision, Writing&#x2013;review and editing. S-QL: Visualization, Writing&#x2013;review and editing. M-LW: Project administration, Writing&#x2013;review and editing. YL: Writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work was supported by the National Natural Sciences Foundation of China (No. 62366002), Yunnan Fundamental Research Projects (No. 202101BA070001-227), Yunnan Young and Middle-aged Academic and Technical Leaders Reserve Talent Project in China (No. 202405AC350023), and a grant (No. 2023KF005) from State Key Laboratory for Conservation and Utilization of Bio-Resources in Yunnan, Yunnan University.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abbasi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Razzaghi</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Poso</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Amanlou</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ghasemi</surname>
<given-names>J. B.</given-names>
</name>
<name>
<surname>Masoudi-Nejad</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>DeepCDA: deep cross-domain compound&#x2013;protein affinity prediction through LSTM and convolutional neural networks</article-title>. <source>Bioinformatics</source> <volume>36</volume>, <fpage>4633</fpage>&#x2013;<lpage>4642</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btaa544</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abbasi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Razzaghi</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Poso</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ghanbari-Ara</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Masoudi-Nejad</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep learning in drug target interaction prediction: current and future perspectives</article-title>. <source>Curr. Med. Chem.</source> <volume>28</volume>, <fpage>2100</fpage>&#x2013;<lpage>2113</lpage>. <pub-id pub-id-type="doi">10.2174/0929867327666200907141016</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Altschul</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Madden</surname>
<given-names>T. L.</given-names>
</name>
<name>
<surname>Sch&#xe4;ffer</surname>
<given-names>A. A.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Miller</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>1997</year>). <article-title>Gapped BLAST and PSI-BLAST: a new generation of protein database search programs</article-title>. <source>Nucleic Acids Res.</source> <volume>25</volume>, <fpage>3389</fpage>&#x2013;<lpage>3402</lpage>. <pub-id pub-id-type="doi">10.1093/nar/25.17.3389</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ballester</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>Mitchell</surname>
<given-names>J. B. O.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>A machine learning approach to predicting protein&#x2013;ligand binding affinity with applications to molecular docking</article-title>. <source>Bioinformatics</source> <volume>26</volume>, <fpage>1169</fpage>&#x2013;<lpage>1175</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btq112</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Berman</surname>
<given-names>H. M.</given-names>
</name>
<name>
<surname>Westbrook</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Gilliland</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Bhat</surname>
<given-names>T. N.</given-names>
</name>
<name>
<surname>Weissig</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2000</year>). <article-title>The protein Data Bank</article-title>. <source>Nucleic Acids Res.</source> <volume>28</volume>, <fpage>235</fpage>&#x2013;<lpage>242</lpage>. <pub-id pub-id-type="doi">10.1093/nar/28.1.235</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bi</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>HiSIF-DTA: a hierarchical semantic information fusion framework for drug-target affinity prediction</article-title>. <source>IEEE J. Biomed. Health Inf.</source>, <fpage>1</fpage>&#x2013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2023.3334239</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>MultiscaleDTA: a multiscale-based method with a self-attention mechanism for drug-target binding affinity prediction</article-title>. <source>Methods</source> <volume>207</volume>, <fpage>103</fpage>&#x2013;<lpage>109</lpage>. <pub-id pub-id-type="doi">10.1016/j.ymeth.2022.09.006</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yan</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>F.-X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Drug-target interaction prediction using multi-head self-attention and graph attention network</article-title>. <source>IEEE/ACM Trans. Comput. Biol. Bioinform.</source> <volume>19</volume>, <fpage>2208</fpage>&#x2013;<lpage>2218</lpage>. <pub-id pub-id-type="doi">10.1109/TCBB.2021.3077905</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Fu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Quan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Hierarchical graph representation learning for the prediction of drug-target binding affinity</article-title>. <source>Inf. Sci.</source> <volume>613</volume>, <fpage>507</fpage>&#x2013;<lpage>523</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2022.09.043</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#xc7;&#x131;naro&#x11f;lu</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Timu&#xe7;in</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Comprehensive evaluation of the MM-GBSA method on bromodomain-inhibitor sets</article-title>. <source>Brief. Bioinform.</source> <volume>21</volume>, <fpage>2112</fpage>&#x2013;<lpage>2125</lpage>. <pub-id pub-id-type="doi">10.1093/bib/bbz143</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Davis</surname>
<given-names>M. I.</given-names>
</name>
<name>
<surname>Hunt</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Herrgard</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ciceri</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wodicka</surname>
<given-names>L. M.</given-names>
</name>
<name>
<surname>Pallares</surname>
<given-names>G.</given-names>
</name>
<etal/>
</person-group> (<year>2011</year>). <article-title>Comprehensive analysis of kinase inhibitor selectivity</article-title>. <source>Nat. Biotechnol.</source> <volume>29</volume>, <fpage>1046</fpage>&#x2013;<lpage>1051</lpage>. <pub-id pub-id-type="doi">10.1038/nbt.1990</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dehghan</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Razzaghi</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Abbasi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Gharaghani</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>TripletMultiDTI: multimodal representation learning in drug-target interaction prediction with triplet loss function</article-title>. <source>Expert Syst. Appl.</source> <volume>232</volume>, <fpage>120754</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.120754</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>ColdDTA: utilizing data augmentation and attention-based feature fusion for drug-target binding affinity prediction</article-title>. <source>Comput. Biol. Med.</source> <volume>164</volume>, <fpage>107372</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107372</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Feng</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Dueva</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Cherkasov</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ester</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>PADME: a deep learning-based framework for drug-target interaction prediction</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/1807.09741">http://arxiv.org/abs/1807.09741</ext-link> (Accessed March 16, 2024)</comment>.</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ghimire</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Tayara</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xuan</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chong</surname>
<given-names>K. T.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>CSatDTA: prediction of drug&#x2013;target binding affinity using convolution model with self-attention</article-title>. <source>Int. J. Mol. Sci.</source> <volume>23</volume>, <fpage>8453</fpage>. <pub-id pub-id-type="doi">10.3390/ijms23158453</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gim</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Choe</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Baek</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Park</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ju</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>ArkDTA: attention regularization guided by non-covalent interactions for explainable drug&#x2013;target binding affinity prediction</article-title>. <source>Bioinformatics</source> <volume>39</volume>, <fpage>i448</fpage>&#x2013;<lpage>i457</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btad207</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ramsundar</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Feinberg</surname>
<given-names>E. N.</given-names>
</name>
<name>
<surname>Pande</surname>
<given-names>V. S.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Atomic convolutional networks for predicting protein-ligand binding affinity</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/1703.10603">http://arxiv.org/abs/1703.10603</ext-link> (Accessed January 4, 2023)</comment>.</citation>
</ref>
<ref id="B18">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Irwin</surname>
<given-names>J. J.</given-names>
</name>
<name>
<surname>Shoichet</surname>
<given-names>B. K.</given-names>
</name>
</person-group> (<year>2006</year>). <source>Zinc &#x2013; a free database of commercially available compounds for virtual screening</source>.</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>Q.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Drug&#x2013;target affinity prediction using graph neural network and contact maps</article-title>. <source>RSC Adv.</source> <volume>10</volume>, <fpage>20701</fpage>&#x2013;<lpage>20712</lpage>. <pub-id pub-id-type="doi">10.1039/D0RA02297G</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Pang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A deep learning method for drug-target affinity prediction based on sequence interaction information mining</article-title>. <source>PeerJ</source> <volume>11</volume>, <fpage>e16625</fpage>. <pub-id pub-id-type="doi">10.7717/peerj.16625</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Sequence-based drug-target affinity prediction using weighted graph neural networks</article-title>. <source>BMC Genomics</source> <volume>23</volume>, <fpage>449</fpage>. <pub-id pub-id-type="doi">10.1186/s12864-022-08648-9</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>CAPLA: improved prediction of protein&#x2013;ligand binding affinity by a deep learning approach based on a cross-attention mechanism</article-title>. <source>Bioinformatics</source> <volume>39</volume>, <fpage>btad049</fpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btad049</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jorgensen</surname>
<given-names>W. L.</given-names>
</name>
<name>
<surname>Thomas</surname>
<given-names>L. L.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Perspective on free-energy perturbation calculations for chemical equilibria</article-title>. <source>J. Chem. Theory Comput.</source> <volume>4</volume>, <fpage>869</fpage>&#x2013;<lpage>876</lpage>. <pub-id pub-id-type="doi">10.1021/ct800011m</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jumper</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Evans</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Pritzel</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Green</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Figurnov</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ronneberger</surname>
<given-names>O.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Highly accurate protein structure prediction with AlphaFold</article-title>. <source>Nature</source> <volume>596</volume>, <fpage>583</fpage>&#x2013;<lpage>589</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-021-03819-2</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kairys</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Baranauskiene</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Kazlauskiene</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Matulis</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Kazlauskas</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Binding affinity in drug design: experimental and computational techniques</article-title>. <source>Expert Opin. Drug Discov.</source> <volume>14</volume>, <fpage>755</fpage>&#x2013;<lpage>768</lpage>. <pub-id pub-id-type="doi">10.1080/17460441.2019.1623202</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kalemati</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Zamani Emani</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Koohi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>BiComp-DTA: drug-target binding affinity prediction through complementary biological-related and compression-based featurization approach</article-title>. <source>PLOS Comput. Biol.</source> <volume>19</volume>, <fpage>e1011036</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1011036</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Karimi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>DeepAffinity: interpretable deep learning of compound&#x2013;protein affinity through unified recurrent and convolutional neural networks</article-title>. <source>Bioinformatics</source> <volume>35</volume>, <fpage>3329</fpage>&#x2013;<lpage>3338</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btz111</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Karimi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Explainable deep relational networks for predicting compound&#x2013;protein affinities and contacts</article-title>. <source>J. Chem. Inf. Model.</source> <volume>61</volume>, <fpage>46</fpage>&#x2013;<lpage>66</lpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.0c00866</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Karin</surname>
<given-names>E. L.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Moriwaki</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ovchinnikov</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Easy and accurate protein structure prediction using ColabFold</article-title>. <source>Protoc. Exch</source>. <pub-id pub-id-type="doi">10.21203/rs.3.pex-2490/v1</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kuhn</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>von Mering</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Campillos</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Jensen</surname>
<given-names>L. J.</given-names>
</name>
<name>
<surname>Bork</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>STITCH: interaction networks of chemicals and proteins</article-title>. <source>Nucleic Acids Res.</source> <volume>36</volume>, <fpage>D684</fpage>&#x2013;<lpage>D688</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkm795</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kwon</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Shin</surname>
<given-names>W.-H.</given-names>
</name>
<name>
<surname>Ko</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>AK-score: accurate protein-ligand binding affinity prediction using an ensemble of 3D-convolutional neural networks</article-title>. <source>Int. J. Mol. Sci.</source> <volume>21</volume>, <fpage>8424</fpage>. <pub-id pub-id-type="doi">10.3390/ijms21228424</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Landrum</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>RDKit: a software suite for cheminformatics, computational chemistry, and predictive modeling</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://www.rdkit.org/RDKit_Overview.pdf">https://www.rdkit.org/RDKit_Overview.pdf</ext-link>.</comment>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>LeCun</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Bengio</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hinton</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Deep learning</article-title>. <source>Nature</source> <volume>521</volume>, <fpage>436</fpage>&#x2013;<lpage>444</lpage>. <pub-id pub-id-type="doi">10.1038/nature14539</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Leung</surname>
<given-names>K.-S.</given-names>
</name>
<name>
<surname>Wong</surname>
<given-names>M.-H.</given-names>
</name>
<name>
<surname>Ballester</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Low-quality structural and interaction data improves binding affinity prediction via random forest</article-title>. <source>Molecules</source> <volume>20</volume>, <fpage>10947</fpage>&#x2013;<lpage>10962</lpage>. <pub-id pub-id-type="doi">10.3390/molecules200610947</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Bo</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>PLA-MoRe: a protein&#x2013;ligand binding affinity prediction model via comprehensive molecular representations</article-title>. <source>J. Chem. Inf. Model.</source> <volume>62</volume>, <fpage>4380</fpage>&#x2013;<lpage>4390</lpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.2c00960</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Xiong</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). &#x201c;<article-title>Structure-aware interactive graph neural networks for the prediction of protein-ligand binding affinity</article-title>,&#x201d; in <source>Proceedings of the 27th ACM SIGKDD conference on knowledge discovery and data mining</source> (<publisher-loc>USA</publisher-loc>: <publisher-name>Virtual Event Singapore: ACM</publisher-name>), <fpage>975</fpage>&#x2013;<lpage>985</lpage>. <pub-id pub-id-type="doi">10.1145/3447548.3467311</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.-M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022b</year>). <article-title>Co-VAE: drug-target binding affinity prediction by Co-regularized variational autoencoders</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell.</source> <volume>44</volume>, <fpage>8861</fpage>&#x2013;<lpage>8873</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2021.3120428</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Comparative assessment of scoring functions on an updated benchmark: 2. Evaluation methods and general results</article-title>. <source>J. Chem. Inf. Model.</source> <volume>54</volume>, <fpage>1717</fpage>&#x2013;<lpage>1736</lpage>. <pub-id pub-id-type="doi">10.1021/ci500081m</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>GSAML-DTA: an interpretable drug-target binding affinity prediction model based on graph neural networks with self-attention mechanism and mutual information</article-title>. <source>Comput. Biol. Med.</source> <volume>150</volume>, <fpage>106145</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106145</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>GeneralizedDTA: combining pre-training and multi-task learning to predict drug-target binding affinity for unknown drug discovery</article-title>. <source>BMC Bioinforma.</source> <volume>23</volume>, <fpage>367</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-022-04905-6</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2022b</year>). <article-title>Detecting drug&#x2013;target interactions with feature similarity fusion and molecular graphs</article-title>. <source>Biology</source> <volume>11</volume>, <fpage>967</fpage>. <pub-id pub-id-type="doi">10.3390/biology11070967</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>P.-S.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Gaines</surname>
<given-names>B. B.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Bi</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>OctSurf: efficient hierarchical voxel-based molecular surface representation for protein-ligand affinity prediction</article-title>. <source>J. Mol. Graph. Model.</source> <volume>105</volume>, <fpage>107865</fpage>. <pub-id pub-id-type="doi">10.1016/j.jmgm.2021.107865</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wen</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Jorissen</surname>
<given-names>R. N.</given-names>
</name>
<name>
<surname>Gilson</surname>
<given-names>M. K.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>BindingDB: a web-accessible database of experimentally determined protein-ligand binding affinities</article-title>. <source>Nucleic Acids Res.</source> <volume>35</volume>, <fpage>D198</fpage>&#x2013;<lpage>D201</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkl999</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Improving drug-target affinity prediction via feature fusion and knowledge distillation</article-title>. <source>Brief. Bioinform.</source> <volume>24</volume>, <fpage>bbad145</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbad145</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Drug-target binding affinity prediction method based on a deep graph neural network</article-title>. <source>Math. Biosci. Eng.</source> <volume>20</volume>, <fpage>269</fpage>&#x2013;<lpage>282</lpage>. <pub-id pub-id-type="doi">10.3934/mbe.2023012</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>N.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Predicting drug-target affinity by learning protein knowledge from biological networks</article-title>. <source>IEEE J. Biomed. Health Inf.</source> <volume>27</volume>, <fpage>2128</fpage>&#x2013;<lpage>2137</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2023.3240305</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mekni</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Fooladi</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Perricone</surname>
<given-names>U.</given-names>
</name>
<name>
<surname>Langer</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Encoding protein-ligand interactions: binding affinity prediction with multigraph-based modeling and graph convolutional network</article-title>. <source>Chemistry</source>. <pub-id pub-id-type="doi">10.26434/chemrxiv-2023-bvps7-v2</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Metz</surname>
<given-names>J. T.</given-names>
</name>
<name>
<surname>Johnson</surname>
<given-names>E. F.</given-names>
</name>
<name>
<surname>Soni</surname>
<given-names>N. B.</given-names>
</name>
<name>
<surname>Merta</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>Kifle</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Hajduk</surname>
<given-names>P. J.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Navigating the kinome</article-title>. <source>Nat. Chem. Biol.</source> <volume>7</volume>, <fpage>200</fpage>&#x2013;<lpage>202</lpage>. <pub-id pub-id-type="doi">10.1038/nchembio.530</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Monteiro</surname>
<given-names>N. R. C.</given-names>
</name>
<name>
<surname>Oliveira</surname>
<given-names>J. L.</given-names>
</name>
<name>
<surname>Arrais</surname>
<given-names>J. P.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>DTITR: end-to-end drug&#x2013;target binding affinity prediction with transformers</article-title>. <source>Comput. Biol. Med.</source> <volume>147</volume>, <fpage>105772</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.105772</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nguyen</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Le</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Quinn</surname>
<given-names>T. P.</given-names>
</name>
<name>
<surname>Le</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Venkatesh</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>GraphDTA: predicting drug&#x2013;target binding affinity with graph neural networks</article-title>. <source>PLoS One</source> <volume>17</volume>, <fpage>e0278387</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0278387</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nguyen</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Le</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Quinn</surname>
<given-names>T. P.</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Le</surname>
<given-names>T. D.</given-names>
</name>
<name>
<surname>Venkatesh</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>GraphDTA: predicting drug-target binding affinity with graph neural networks</article-title>. <source>Bioinforma. Oxf. Engl.</source> <volume>37</volume>, <fpage>1140</fpage>&#x2013;<lpage>1147</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btaa921</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#xd6;zt&#xfc;rk</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>&#xd6;zg&#xfc;r</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ozkirimli</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>DeepDTA: deep drug&#x2013;target binding affinity prediction</article-title>. <source>Bioinformatics</source> <volume>34</volume>, <fpage>i821</fpage>&#x2013;<lpage>i829</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/bty593</pub-id>
</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>SubMDTA: drug target affinity prediction based on substructure extraction and multi-scale features</article-title>. <source>BMC Bioinforma.</source> <volume>24</volume>, <fpage>334</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-023-05460-4</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pandey</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Radaeva</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Mslati</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Garland</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>Fernandez</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ester</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Ligand binding prediction using protein structure graphs and residual graph attention networks</article-title>. <source>Molecules</source> <volume>27</volume>, <fpage>5114</fpage>. <pub-id pub-id-type="doi">10.3390/molecules27165114</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rafiei</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zeraati</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Abbasi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Ghasemi</surname>
<given-names>J. B.</given-names>
</name>
<name>
<surname>Parsaeian</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Masoudi-Nejad</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>DeepTraSynergy: drug combinations using multimodal deep learning with transformers</article-title>. <source>Bioinformatics</source> <volume>39</volume>, <fpage>btad438</fpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btad438</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Remmert</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Biegert</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hauser</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>S&#xf6;ding</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>HHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment</article-title>. <source>Nat. Methods</source> <volume>9</volume>, <fpage>173</fpage>&#x2013;<lpage>175</lpage>. <pub-id pub-id-type="doi">10.1038/nmeth.1818</pub-id>
</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rifaioglu</surname>
<given-names>A. S.</given-names>
</name>
<name>
<surname>Cetin Atalay</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Cansen Kahraman</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Do&#x11f;an</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Martin</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Atalay</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>MDeePred: novel multi-channel protein featurization for deep learning-based binding affinity prediction in drug discovery</article-title>. <source>Bioinformatics</source> <volume>37</volume>, <fpage>693</fpage>&#x2013;<lpage>704</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btaa858</pub-id>
</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rives</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Meier</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sercu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Goyal</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences</article-title>. <source>Proc. Natl. Acad. Sci.</source> <volume>118</volume>, <fpage>e2016239118</fpage>. <pub-id pub-id-type="doi">10.1073/pnas.2016239118</pub-id>
</citation>
</ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ru</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zou</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Optimization of drug&#x2013;target affinity prediction methods through feature processing schemes</article-title>. <source>Bioinformatics</source> <volume>39</volume>, <fpage>btad615</fpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btad615</pub-id>
</citation>
</ref>
<ref id="B60">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rube</surname>
<given-names>H. T.</given-names>
</name>
<name>
<surname>Rastogi</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kribelbauer</surname>
<given-names>J. F.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Becerra</surname>
<given-names>B.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Prediction of protein&#x2013;ligand binding affinity from sequencing data with interpretable machine learning</article-title>. <source>Nat. Biotechnol.</source> <volume>40</volume>, <fpage>1520</fpage>&#x2013;<lpage>1527</lpage>. <pub-id pub-id-type="doi">10.1038/s41587-022-01307-0</pub-id>
</citation>
</ref>
<ref id="B61">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Seo</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Choi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Park</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ahn</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Binding affinity prediction for protein&#x2013;ligand complex using deep attention mechanism based on intermolecular interactions</article-title>. <source>BMC Bioinforma.</source> <volume>22</volume>, <fpage>542</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-021-04466-0</pub-id>
</citation>
</ref>
<ref id="B62">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shar</surname>
<given-names>P. A.</given-names>
</name>
<name>
<surname>Tao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Pred-binding: large-scale protein&#x2013;ligand binding affinity prediction</article-title>. <source>J. Enzyme Inhib. Med. Chem.</source> <volume>31</volume>, <fpage>1443</fpage>&#x2013;<lpage>1450</lpage>. <pub-id pub-id-type="doi">10.3109/14756366.2016.1144594</pub-id>
</citation>
</ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A cascade graph convolutional network for predicting protein&#x2013;ligand binding affinity</article-title>. <source>Int. J. Mol. Sci.</source> <volume>22</volume>, <fpage>4023</fpage>. <pub-id pub-id-type="doi">10.3390/ijms22084023</pub-id>
</citation>
</ref>
<ref id="B64">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shim</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>Z.-Y.</given-names>
</name>
<name>
<surname>Sohn</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Hwang</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Prediction of drug&#x2013;target binding affinity using similarity-based convolutional neural network</article-title>. <source>Sci. Rep.</source> <volume>11</volume>, <fpage>4416</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-021-83679-y</pub-id>
</citation>
</ref>
<ref id="B65">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Stepniewska-Dziubinska</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Zielenkiewicz</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Siedlecki</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Development and evaluation of a deep learning model for protein&#x2013;ligand binding affinity prediction</article-title>. <source>Bioinformatics</source> <volume>34</volume>, <fpage>3666</fpage>&#x2013;<lpage>3674</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/bty374</pub-id>
</citation>
</ref>
<ref id="B66">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Su</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Comparative assessment of scoring functions: the CASF-2016 update</article-title>. <source>J. Chem. Inf. Model.</source> <volume>59</volume>, <fpage>895</fpage>&#x2013;<lpage>913</lpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.8b00545</pub-id>
</citation>
</ref>
<ref id="B67">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Suzek</surname>
<given-names>B. E.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>McGarvey</surname>
<given-names>P. B.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>C. H.</given-names>
</name>
</person-group>
<collab>the UniProt Consortium</collab> (<year>2015</year>). <article-title>UniRef clusters: a comprehensive and scalable alternative for improving sequence similarity searches</article-title>. <source>Bioinformatics</source> <volume>31</volume>, <fpage>926</fpage>&#x2013;<lpage>932</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btu739</pub-id>
</citation>
</ref>
<ref id="B68">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Szwajda</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Shakyawar</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Hintsanen</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wennerberg</surname>
<given-names>K.</given-names>
</name>
<etal/>
</person-group> (<year>2014</year>). <article-title>Making sense of large-scale kinase inhibitor bioactivity data sets: a comparative and integrative analysis</article-title>. <source>J. Chem. Inf. Model.</source> <volume>54</volume>, <fpage>735</fpage>&#x2013;<lpage>743</lpage>. <pub-id pub-id-type="doi">10.1021/ci400709d</pub-id>
</citation>
</ref>
<ref id="B69">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>The</surname>
<given-names>U. P. C.</given-names>
</name>
<name>
<surname>Bateman</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Martin</surname>
<given-names>M.-J.</given-names>
</name>
<name>
<surname>Orchard</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Magrane</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Agivetova</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>UniProt: the universal protein knowledgebase in 2021</article-title>. <source>Nucleic Acids Res.</source> <volume>49</volume>, <fpage>D480</fpage>&#x2013;<lpage>D489</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkaa1100</pub-id>
</citation>
</ref>
<ref id="B70">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Cui</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>GTAMP-DTA: graph transformer combined with attention mechanism for drug-target binding affinity prediction</article-title>. <source>Comput. Biol. Chem.</source> <volume>108</volume>, <fpage>107982</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiolchem.2023.107982</pub-id>
</citation>
</ref>
<ref id="B71">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Yue</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Predicting drug-target affinity based on recurrent neural networks and graph convolutional neural networks</article-title>. <source>Comb. Chem. High. Throughput Screen.</source> <volume>25</volume>, <fpage>634</fpage>&#x2013;<lpage>641</lpage>. <pub-id pub-id-type="doi">10.2174/1386207324666210215101825</pub-id>
</citation>
</ref>
<ref id="B72">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Tsui</surname>
<given-names>L.-I.</given-names>
</name>
<name>
<surname>Hsu</surname>
<given-names>T.-C.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2023</year>). &#x201c;<article-title>NG-DTA: drug-target affinity prediction with n-gram molecular graphs</article-title>,&#x201d; in <source>2023 45th annual international conference of the IEEE engineering in medicine and biology society (EMBC)</source> (<publisher-loc>Sydney, Australia</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.1109/EMBC40787.2023.10339968</pub-id>
</citation>
</ref>
<ref id="B73">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Vaswani</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Shazeer</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Parmar</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Uszkoreit</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jones</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Gomez</surname>
<given-names>A. N.</given-names>
</name>
<etal/>
</person-group> (<year>2017</year>). <article-title>Attention is all you need</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/1706.03762">http://arxiv.org/abs/1706.03762</ext-link> (Accessed May 18, 2023)</comment>.</citation>
</ref>
<ref id="B74">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Fusion-based deep learning architecture for detecting drug-target binding affinity using target and drug sequence and structure</article-title>. <source>IEEE J. Biomed. Health Inf.</source> <volume>27</volume>, <fpage>6112</fpage>&#x2013;<lpage>6120</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2023.3315073</pub-id>
</citation>
</ref>
<ref id="B75">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>DeepDTAF: a deep learning method to predict protein&#x2013;ligand binding affinity</article-title>. <source>Brief. Bioinform.</source> <volume>22</volume>, <fpage>bbab072</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbab072</pub-id>
</citation>
</ref>
<ref id="B76">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<etal/>
</person-group> (<year>2023a</year>). <article-title>AffinityVAE: a multi-objective model for protein-ligand affinity prediction and drug design</article-title>. <source>Comput. Biol. Chem.</source> <volume>107</volume>, <fpage>107971</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiolchem.2023.107971</pub-id>
</citation>
</ref>
<ref id="B77">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>C.-Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>The PDBbind database: methodologies and updates</article-title>. <source>J. Med. Chem.</source> <volume>48</volume>, <fpage>4111</fpage>&#x2013;<lpage>4119</lpage>. <pub-id pub-id-type="doi">10.1021/jm048957q</pub-id>
</citation>
</ref>
<ref id="B78">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Shan</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zuo</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2021b</year>). <article-title>GanDTI: a multi-task neural network for drug-target interaction prediction</article-title>. <source>Comput. Biol. Chem.</source> <volume>92</volume>, <fpage>107476</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiolchem.2021.107476</pub-id>
</citation>
</ref>
<ref id="B79">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ren</surname>
<given-names>C.</given-names>
</name>
<etal/>
</person-group> (<year>2023b</year>). <article-title>MSGNN-DTA: multi-scale topological feature fusion based on graph neural networks for drug&#x2013;target binding affinity prediction</article-title>. <source>Int. J. Mol. Sci.</source> <volume>24</volume>, <fpage>8326</fpage>. <pub-id pub-id-type="doi">10.3390/ijms24098326</pub-id>
</citation>
</ref>
<ref id="B80">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Xi</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Sfcnn: a novel scoring function based on 3D convolutional neural network for accurate and stable protein&#x2013;ligand affinity prediction</article-title>. <source>BMC Bioinforma.</source> <volume>23</volume>, <fpage>222</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-022-04762-3</pub-id>
</citation>
</ref>
<ref id="B81">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Weininger</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>1988</year>). <article-title>SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules</article-title>. <source>J. Chem. Inf. Model.</source> <volume>28</volume>, <fpage>31</fpage>&#x2013;<lpage>36</lpage>. <pub-id pub-id-type="doi">10.1021/ci00057a005</pub-id>
</citation>
</ref>
<ref id="B82">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Zou</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Cui</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>AttentionMGT-DTA: a multi-modal drug-target affinity prediction using graph transformer and attention mechanism</article-title>. <source>Neural Netw.</source> <volume>169</volume>, <fpage>623</fpage>&#x2013;<lpage>636</lpage>. <pub-id pub-id-type="doi">10.1016/j.neunet.2023.11.018</pub-id>
</citation>
</ref>
<ref id="B83">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Niu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Drug-target binding affinity prediction using message passing neural network and self supervised learning</article-title>. <source>BMC Genomics</source> <volume>24</volume>, <fpage>557</fpage>. <pub-id pub-id-type="doi">10.1186/s12864-023-09664-z</pub-id>
</citation>
</ref>
<ref id="B84">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Leskovec</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jegelka</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>HOW POWERFUL ARE GRAPH NEURAL NETWORKS?</article-title> <source>Int. Conf. Learn. Represent</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1810.00826</pub-id>
</citation>
</ref>
<ref id="B85">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Ru</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Application of machine learning for drug&#x2013;target interaction prediction</article-title>. <source>Front. Genet.</source> <volume>12</volume>, <fpage>680117</fpage>. <pub-id pub-id-type="doi">10.3389/fgene.2021.680117</pub-id>
</citation>
</ref>
<ref id="B86">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>GraphCL-DTA: a graph contrastive learning with molecular semantics for drug-target binding affinity prediction</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/2307.08989">http://arxiv.org/abs/2307.08989</ext-link> (Accessed January 11, 2024)</comment>.</citation>
</ref>
<ref id="B87">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Yu-Chian Chen</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>MGraphDTA: deep multiscale graph neural network for explainable drug&#x2013;target binding affinity prediction</article-title>. <source>Chem. Sci.</source> <volume>13</volume>, <fpage>816</fpage>&#x2013;<lpage>833</lpage>. <pub-id pub-id-type="doi">10.1039/D1SC05180F</pub-id>
</citation>
</ref>
<ref id="B88">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yuan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Protein-ligand binding affinity prediction model based on graph attention network</article-title>. <source>Math. Biosci. Eng.</source> <volume>18</volume>, <fpage>9148</fpage>&#x2013;<lpage>9162</lpage>. <pub-id pub-id-type="doi">10.3934/mbe.2021451</pub-id>
</citation>
</ref>
<ref id="B89">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Zaremba</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Sutskever</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Vinyals</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Recurrent neural network regularization</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/1409.2329">http://arxiv.org/abs/1409.2329</ext-link> (Accessed May 18, 2023)</comment>.</citation>
</ref>
<ref id="B90">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zeng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>K.-Y.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Fusing sequence and structural knowledge by heterogeneous models to accurately and interpretively predict drug&#x2013;target affinity</article-title>. <source>Molecules</source> <volume>28</volume>, <fpage>8005</fpage>. <pub-id pub-id-type="doi">10.3390/molecules28248005</pub-id>
</citation>
</ref>
<ref id="B91">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zeng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep drug-target binding affinity prediction with multiple attention blocks</article-title>. <source>Brief. Bioinform.</source> <volume>22</volume>, <fpage>bbab117</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbab117</pub-id>
</citation>
</ref>
<ref id="B92">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Saravanan</surname>
<given-names>K. M.</given-names>
</name>
<name>
<surname>Yin</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>DeepBindRG: a deep learning based method for estimating effective protein&#x2013;ligand affinity</article-title>. <source>PeerJ</source> <volume>7</volume>, <fpage>e7362</fpage>. <pub-id pub-id-type="doi">10.7717/peerj.7362</pub-id>
</citation>
</ref>
<ref id="B93">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Ouyang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>Multimodal contrastive representation learning for drug-target binding affinity prediction</article-title>. <source>Methods</source> <volume>220</volume>, <fpage>126</fpage>&#x2013;<lpage>133</lpage>. <pub-id pub-id-type="doi">10.1016/j.ymeth.2023.11.005</pub-id>
</citation>
</ref>
<ref id="B94">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.-C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Predicting drug&#x2013;target binding affinity through molecule representation block based on multi-head attention and skip connection</article-title>. <source>Brief. Bioinform.</source> <volume>23</volume>, <fpage>bbac468</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbac468</pub-id>
</citation>
</ref>
<ref id="B95">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.-C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>GPCNDTA: prediction of drug-target binding affinity through cross-attention networks augmented with graph features and pharmacophores</article-title>. <source>Comput. Biol. Med.</source> <volume>166</volume>, <fpage>107512</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107512</pub-id>
</citation>
</ref>
<ref id="B96">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>SAG-DTA: prediction of drug&#x2013;target affinity using self-attention graph network</article-title>. <source>Int. J. Mol. Sci.</source> <volume>22</volume>, <fpage>8993</fpage>. <pub-id pub-id-type="doi">10.3390/ijms22168993</pub-id>
</citation>
</ref>
<ref id="B97">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2023c</year>). <article-title>SS-GNN: a simple-structured graph neural network for affinity prediction</article-title>. <source>ACS Omega</source> <volume>8</volume>, <fpage>22496</fpage>&#x2013;<lpage>22507</lpage>. <pub-id pub-id-type="doi">10.1021/acsomega.3c00085</pub-id>
</citation>
</ref>
<ref id="B98">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
<etal/>
</person-group> (<year>2023d</year>). <article-title>PLANET: a multi-objective graph neural network model for protein&#x2013;ligand binding affinity prediction</article-title>. <source>J. Chem. Inf. Model., Acs.jcim.</source>, <fpage>3c00253</fpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.3c00253</pub-id>
</citation>
</ref>
<ref id="B99">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2023e</year>). <article-title>A survey of drug-target interaction and affinity prediction methods via graph neural networks</article-title>. <source>Comput. Biol. Med.</source> <volume>163</volume>, <fpage>107136</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107136</pub-id>
</citation>
</ref>
<ref id="B100">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Duan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>AttentionDTA: drug-target binding affinity prediction by sequence-based deep learning with attention mechanism</article-title>. <source>IEEE/ACM Trans. Comput. Biol. Bioinform.</source> <volume>20</volume>, <fpage>852</fpage>&#x2013;<lpage>863</lpage>. <pub-id pub-id-type="doi">10.1109/TCBB.2022.3170365</pub-id>
</citation>
</ref>
<ref id="B101">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Mu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>OnionNet: a multiple-layer intermolecular-contact-based convolutional neural network for protein&#x2013;ligand binding affinity prediction</article-title>. <source>ACS Omega</source> <volume>4</volume>, <fpage>15956</fpage>&#x2013;<lpage>15965</lpage>. <pub-id pub-id-type="doi">10.1021/acsomega.9b01997</pub-id>
</citation>
</ref>
<ref id="B102">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Xiang</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>TransVAE-DTA: transformer and variational autoencoder network for drug-target binding affinity prediction</article-title>. <source>Comput. Methods Programs Biomed.</source> <volume>244</volume>, <fpage>108003</fpage>. <pub-id pub-id-type="doi">10.1016/j.cmpb.2023.108003</pub-id>
</citation>
</ref>
<ref id="B103">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wen</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>DataDTA: a multi-feature and dual-interaction aggregation framework for drug&#x2013;target binding affinity prediction</article-title>. <source>Bioinformatics</source> <volume>39</volume>, <fpage>btad560</fpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btad560</pub-id>
</citation>
</ref>
<ref id="B104">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Mazur</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Cong</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>Associative learning mechanism for drug&#x2010;target interaction prediction</article-title>. <source>CAAI Trans. Intell. Technol.</source> <volume>8</volume>, <fpage>1558</fpage>&#x2013;<lpage>1577</lpage>. <pub-id pub-id-type="doi">10.1049/cit2.12194</pub-id>
</citation>
</ref>
<ref id="B105">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Mazur</surname>
<given-names>N.</given-names>
</name>
<etal/>
</person-group> (<year>2023c</year>). <article-title>Drug&#x2013;target affinity prediction method based on multi-scale information interaction and graph optimization</article-title>. <source>Comput. Biol. Med.</source> <volume>167</volume>, <fpage>107621</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107621</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>