Back to Search
Start Over
DGDTA: dynamic graph attention network for predicting drug–target binding affinity.
- Source :
- BMC Bioinformatics; 9/30/2023, Vol. 24 Issue 1, p1-15, 15p
- Publication Year :
- 2023
-
Abstract
- Background: Obtaining accurate drug–target binding affinity (DTA) information is significant for drug discovery and drug repositioning. Although some methods have been proposed for predicting DTA, the features of proteins and drugs still need to be further analyzed. Recently, deep learning has been successfully used in many fields. Hence, designing a more effective deep learning method for predicting DTA remains attractive. Results: Dynamic graph DTA (DGDTA), which uses a dynamic graph attention network combined with a bidirectional long short-term memory (Bi-LSTM) network to predict DTA is proposed in this paper. DGDTA adopts drug compound as input according to its corresponding simplified molecular input line entry system (SMILES) and protein amino acid sequence. First, each drug is considered a graph of interactions between atoms and edges, and dynamic attention scores are used to consider which atoms and edges in the drug are most important for predicting DTA. Then, Bi-LSTM is used to better extract the contextual information features of protein amino acid sequences. Finally, after combining the obtained drug and protein feature vectors, the DTA is predicted by a fully connected layer. The source code is available from GitHub at https://github.com/luojunwei/DGDTA. Conclusions: The experimental results show that DGDTA can predict DTA more accurately than some other methods. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14712105
- Volume :
- 24
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- BMC Bioinformatics
- Publication Type :
- Academic Journal
- Accession number :
- 172438990
- Full Text :
- https://doi.org/10.1186/s12859-023-05497-5