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

Scoring protein-ligand binding structures through learning atomic graphs with inter-molecular adjacency

Author

Listed:
  • Debby D Wang
  • Yuting Huang

Abstract

With a burgeoning number of artificial intelligence (AI) applications in various fields, biomolecular science has also given a big welcome to advanced AI techniques in recent years. In this broad field, scoring a protein-ligand binding structure to output the binding strength is a crucial problem that heavily relates to computational drug discovery. Aiming at this problem, we have proposed an efficient scoring framework using deep learning techniques. This framework describes a binding structure by a high-resolution atomic graph, places a focus on the inter-molecular interactions and learns the graph in a rational way. For a protein-ligand binding complex, the generated atomic graph reserves key information of the atoms (as graph nodes), and focuses on inter-molecular interactions (as graph edges) that can be identified by introducing multiple distance ranges to the atom pairs within the binding area. To provide more confidence in the predicted binding strengths, we have interpreted the deep learning model from the model level and in a post-hoc analysis. The proposed learning framework has been demonstrated to have competitive performances in scoring and screening tasks, which will prospectively promote the development of related fields further.Author summary: The binding between a small compound (ligand) and a protein plays a crucial role in many biological processes, such as signal transduction and immunoreaction. Particularly, a small-molecule drug can bind to a target protein to modulate its signaling pathways and suppress the progression of the associated disease. Apparently, the binding strength is a key indicator for evaluating how well such small-molecule drugs work, therefore becoming a core topic in computational drug discovery. Nowadays, the binding structure of a ligand and its target protein can be resolved experimentally or modeled computationally, while the accurate scoring of such a binding structure (predicting the binding strength) still remains a challenge. An effort has been put into the development of benchmark databases that provide a variety of protein-ligand binding structures and their experimentally resolved binding strengths, leading to increasing deep learning applications in this field. In this study, we represent a protein-ligand binding structure as a graph, with the atoms as nodes and the inter-molecular interactions as edges. A light but efficient deep learning architecture has been adopted for learning such graphs and outputting the binding strengths. Validated by our experiments, the model performs well in both scoring and screening tasks.

Suggested Citation

  • Debby D Wang & Yuting Huang, 2025. "Scoring protein-ligand binding structures through learning atomic graphs with inter-molecular adjacency," PLOS Computational Biology, Public Library of Science, vol. 21(5), pages 1-20, May.
  • Handle: RePEc:plo:pcbi00:1013074
    DOI: 10.1371/journal.pcbi.1013074
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013074
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1013074&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1013074?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:pcbi00:1013074. 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: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    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.