Pith. sign in

REVIEW 2 cited by

WideDTA: prediction of drug-target binding affinity

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.04166 v1 pith:FXYGDM3S submitted 2019-02-04 q-bio.QM cs.LGstat.ML

classification q-bio.QMcs.LGstat.ML
keywords affinitybindinginformationproteinsequencepredictionwidedtadeep
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Motivation: Prediction of the interaction affinity between proteins and compounds is a major challenge in the drug discovery process. WideDTA is a deep-learning based prediction model that employs chemical and biological textual sequence information to predict binding affinity. Results: WideDTA uses four text-based information sources, namely the protein sequence, ligand SMILES, protein domains and motifs, and maximum common substructure words to predict binding affinity. WideDTA outperformed one of the state of the art deep learning methods for drug-target binding affinity prediction, DeepDTA on the KIBA dataset with a statistical significance. This indicates that the word-based sequence representation adapted by WideDTA is a promising alternative to the character-based sequence representation approach in deep learning models for binding affinity prediction, such as the one used in DeepDTA. In addition, the results showed that, given the protein sequence and ligand SMILES, the inclusion of protein domain and motif information as well as ligand maximum common substructure words do not provide additional useful information for the deep learning model. Interestingly, however, using only domain and motif information to represent proteins achieved similar performance to using the full protein sequence, suggesting that important binding relevant information is contained within the protein motifs and domains.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DynamicDTA: Drug-Target Binding Affinity Prediction Using Dynamic Descriptors and Graph Representation

    cs.RO 2025-05 reject novelty 5.0 of 10

    DynamicDTA combines a drug molecular graph, a protein sequence encoder, and four per-protein dynamic descriptors with cross-attention and tensor fusion to predict binding affinity, outperforming seven baselines in mos...

  2. Hybrid Quantum Neural Networks for Efficient Protein-Ligand Binding Affinity Prediction

    cs.ET 2025-09 conditional novelty 4.0 of 10

    A hybrid quantum-classical network matches or slightly beats classical baselines on protein-ligand binding affinity prediction while using fewer parameters.

Pith tools