Abstract
Background: Drug development requires a lot of money and time, and the outcome of the challenge is unknown. So, there is an urgent need for researchers to find a new approach that can reduce costs. Therefore, the identification of drug-target interactions (DTIs) has been a critical step in the early stages of drug discovery. These computational methods aim to narrow the search space for novel DTIs and to elucidate the functional background of drugs. Most of the methods developed so far use binary classification to predict the presence or absence of interactions between the drug and the target. However, it is more informative but also more challenging to predict the strength of the binding between a drug and its target. If the strength is not strong enough, such a DTI may not be useful. Hence, the development of methods to predict drug-target affinity (DTA) is of significant importance
Method: We have improved the GraphDTA model from a dual-channel model to a triple-channel model. We interpreted the target/protein sequences as time series and extracted their features using the LSTM network. For the drug, we considered both the molecular structure and the local chemical background, retaining the four variant networks used in GraphDTA to extract the topological features of the drug and capturing the local chemical background of the atoms in the drug by using BiGRU. Thus, we obtained the latent features of the target and two latent features of the drug. The connection of these three feature vectors is then inputted into a 2 layer FC network, and a valuable binding affinity is the output.
Result: We used the Davis and Kiba datasets, using 80% of the data for training and 20% of the data for validation. Our model showed better performance when compared with the experimental results of GraphDTA
Conclusion: In this paper, we altered the GraphDTA model to predict drug-target affinity. It represents the drug as a graph and extracts the two-dimensional drug information using a graph convolutional neural network. Simultaneously, the drug and protein targets are represented as a word vector, and the convolutional neural network is used to extract the time-series information of the drug and the target. We demonstrate that our improved method has better performance than the original method. In particular, our model has better performance in the evaluation of benchmark databases.
Keywords: Drug repurposing, drug-target affinity, SMILES, BiGRU, LSTM, proteins.
Graphical Abstract
[http://dx.doi.org/10.1038/s41598-019-46293-7] [PMID: 31285471]
[http://dx.doi.org/10.1504/IJAIS.2019.108428]
[http://dx.doi.org/10.1504/IJAIS.2019.108417]
[http://dx.doi.org/10.1109/TCDS.2017.2785332]
[http://dx.doi.org/10.1186/1758-2946-5-30] [PMID: 23800010]
[http://dx.doi.org/10.1093/bioinformatics/btn186] [PMID: 18586736]
[http://dx.doi.org/10.1109/TKDE.2005.127]
[http://dx.doi.org/10.1126/science.1075762] [PMID: 12471243]
[http://dx.doi.org/10.1021/jm5006429] [PMID: 24914455]
[http://dx.doi.org/10.1504/IJAIS.2019.108402]
[http://dx.doi.org/10.1504/IJAIS.2019.108397]
[http://dx.doi.org/10.1093/bioinformatics/bty593] [PMID: 30423097]
[http://dx.doi.org/10.1038/s41598-018-25440-6] [PMID: 29765058]
[http://dx.doi.org/10.1093/nar/gkp885]
[http://dx.doi.org/10.1093/bioinformatics/btaa544] [PMID: 32462178]
[http://dx.doi.org/10.1162/neco.1997.9.8.1735] [PMID: 9377276]
[http://dx.doi.org/10.1504/IJAIS.2019.108381]
[http://dx.doi.org/10.1109/TNB.2018.2873221] [PMID: 30281471]
[http://dx.doi.org/10.1109/TNB.2019.2896981] [PMID: 30716044]
[http://dx.doi.org/10.1504/IJAIS.2015.074410]
[http://dx.doi.org/10.18632/oncotarget.23733]
[http://dx.doi.org/10.1016/j.ins.2016.08.055]
[http://dx.doi.org/10.3390/molecules23061307]
[http://dx.doi.org/10.1021/ci00057a005]
[http://dx.doi.org/10.1093/comjnl/bxz049]
[http://dx.doi.org/10.1109/ACCESS.2019.2933364]
[http://dx.doi.org/10.1109/JSTARS.2020.2998461]
[http://dx.doi.org/10.1109/ACCESS.2019.2953934]
[http://dx.doi.org/10.1109/BIBM.2018.8621313]
[http://dx.doi.org/10.1007/s11063-018-9947-9]
[http://dx.doi.org/10.1155/2019/1939171]
[http://dx.doi.org/10.1175/JTECH-D-19-0168.1]
[http://dx.doi.org/10.1371/journal.pone.0108856] [PMID: 25303242]
[http://dx.doi.org/10.1038/nbt.1990] [PMID: 22037378]
[http://dx.doi.org/10.1021/ci400709d] [PMID: 24521231]