Cited by 22Computational Drug Discovery MethodsMachine Learning in BioinformaticsBioinformatics and Genomic Networks

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

CPGL: Prediction of Compound-Protein Interaction by Integrating Graph Attention Network With Long Short-Term Memory Neural Network

Open access
Zhao, Minghua, Yuan, Min, Yang, Yaning, Xu, Steven X·2023·IEEE/ACM Transactions on Computational Biology and Bioinformatics

Published version of a preprint

Abstract

Recent advancements of artificial intelligence based on deep learning algorithms have made it possible to computationally predict compound-protein interaction (CPI) without conducting laboratory experiments. In this manuscript, we integrated a graph attention network (GAT) for compounds and a long short-term memory neural network (LSTM) for proteins, used end-to-end representation learning for both compounds and proteins, and proposed a deep learning algorithm, CPGL (CPI with GAT and LSTM) to optimize the feature extraction from compounds and proteins and to improve the model robustness and generalizability. CPGL demonstrated an excellent predictive performance and outperforms recently reported deep learning models. Based on 3 public CPI datasets, C.elegans, Human and BindingDB, CPGL represented 1 - 5% improvement compared to existing deep-learning models. Our method also achieves excellent results on datasets with imbalanced positive and negative proportions constructed based on the C.elegans and Human datasets. More importantly, using 2 label reversal datasets, GPCR and Kinase, CPGL showed superior performance compared to other existing deep learning models. The AUC were substantially improved by 20% on the Kinase dataset, indicative of the robustness and generalizability of CPGL.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcbb.2022.3225296

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 32

  1. 10.1093/bioinformatics/btaa544 · DOI
  2. 10.1093/bioinformatics/bti801 · DOI
  3. 10.1093/bioinformatics/bty535 · DOI · Paper page
  4. 10.1093/bioinformatics/bty178 · DOI
  5. 10.1093/bioinformatics/btz111 · DOI
  6. mikolov, 2013, Distributed representations of words and phrases and their compositionality, Adv Neural Inf Process Syst, 26, 3111
  7. 10.24963/ijcai.2018/468 · DOI
  8. mazzaferro, 2017, Predicting protein binding affinity with word embeddings and recurrent neural networks, 10.1101/128223 · DOI
  9. 10.1093/bioinformatics/btaa524 · DOI · Paper page
  10. 10.1371/journal.pone.0141287 · DOI
  11. 10.1038/nature11159 · DOI
  12. 10.1093/bib/bbac033 · DOI
  13. 10.1038/s42256-020-0152-y · DOI
  14. 10.1145/3307339.3342186 · DOI
  15. 10.1109/TNNLS.2020.2978386 · DOI · Paper page
  16. 10.1038/s41598-022-10775-y · DOI
  17. 10.1093/bib/bbab491 · DOI
  18. 10.3389/fbinf.2022.959160 · DOI · Paper page
  19. 10.1007/978-3-642-24797-2_4 · DOI · Paper page
  20. 10.1093/bib/bbab152 · DOI
  21. 10.1093/nar/gkm958 · DOI
  22. 10.1093/nar/gkv1072 · DOI
  23. 10.1186/s12859-020-03899-3 · DOI
  24. 10.1016/j.aiopen.2021.01.001 · DOI · Paper page
  25. costa, 2020, Fast neighborhood subgraph pairwise distance kernel, Proc Int Conf Mach Learn
  26. 10.1162/neco_a_01199 · DOI
  27. vaswani, 0, Attention is all you need, Proc Adv Neural Inf Process Syst, 6000
  28. 10.1093/bioinformatics/bty593 · DOI
  29. 10.1016/j.drudis.2013.01.008 · DOI
  30. 10.1371/journal.pcbi.1007129 · DOI
  31. 10.1093/bib/bby061 · DOI
  32. 10.1093/bioinformatics/btv256 · DOI

Metadata

Authors
Zhao, M., Yuan, M., Yang, Y., & Xu, S. X.
Affiliations
  • University of Science and Technology of China (CN)
  • Anhui Medical University (CN)
  • Genmab (United States) (US)
Corresponding author
  • Yang, Yaning
  • Xu, Steven X
Venue
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Published
2023-05-01
Volume
20
Issue
3
Pages
1935-1942
ISSN
  • 1545-5963 (ISSN-L)
  • 1557-9964
  • 2374-0043
OpenAlex
W4310457446
Cited by
22
References
6
Citations by year
2026: 3 · 2025: 13 · 2024: 5 · 2023: 1
FWCI
2.57
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Computational Biology and Bioinformatics (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (11671375)
  • Natural Science Foundation of Anhui Province (2008085MA09)
Topics
  • Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
Keywords
compound-protein interaction prediction, graph attention networks, long short-term memory, feature extraction, class imbalance, G protein-coupled receptors, kinases, Caenorhabditis elegans, human protein, BindingDB
MeSH terms
Algorithms, Animals, Artificial Intelligence, Humans, Memory, Short-Term, Proteins, Neural Networks, Computer, Caenorhabditis elegans

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review