IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0315718.html
   My bibliography  Save this article

Drug target affinity prediction based on multi-scale gated power graph and multi-head linear attention mechanism

Author

Listed:
  • Shuo Hu
  • Jing Hu
  • Xiaolong Zhang
  • Shuting Jin
  • Xin Xu

Abstract

For the purpose of developing new drugs and repositioning existing ones, accurate drug-target affinity (DTA) prediction is essential. While graph neural networks are frequently utilized for DTA prediction, it is difficult for existing single-scale graph neural networks to access the global structure of compounds. We propose a novel DTA prediction model in this study, MAPGraphDTA, which uses an approach based on a multi-head linear attention mechanism that aggregates global features based on the attention weights and a multi-scale gated power graph that captures multi-hop connectivity relationships of graph nodes. In order to accurately extract drug target features, we provide a gated skip-connection approach in multiscale graph neural networks, which is used to fuse multiscale features to produce a rich representation of feature information. We experimented on the Davis, Kiba, Metz, and DTC datasets, and we evaluated the proposed method against other relevant models. Based on all evaluation metrics, MAPGraphDTA outperforms the other models, according to the results of the experiment. We also performed cold-start experiments on the Davis dataset, which showed that our model has good prediction ability for unseen drugs, unseen proteins, and cases where neither drugs nor proteins has been seen.

Suggested Citation

  • Shuo Hu & Jing Hu & Xiaolong Zhang & Shuting Jin & Xin Xu, 2025. "Drug target affinity prediction based on multi-scale gated power graph and multi-head linear attention mechanism," PLOS ONE, Public Library of Science, vol. 20(2), pages 1-19, February.
  • Handle: RePEc:plo:pone00:0315718
    DOI: 10.1371/journal.pone.0315718
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0315718
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0315718&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0315718?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0315718. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.