CoChat

PLINDER: The protein-ligand interactions dataset and evaluation resource

Open access
Durairaj, Janani, Adeshina, Yusuf, Cao, Zhonglin, Zhang, Xuejin, Oleinikovas, Vladas, Duignan, Thomas, McClure, Zachary, Robin, Xavier, Studer, Gabriel, Kovtun, Daniel, Rossi, Emanuele, Zhou, Guoqing, Veccham, Srimukh, Isert, Clemens, Peng, Yuxing, Sundareson, Prabindh, Akdel, Mehmet, Corso, Gabriele, Stärk, Hannes, Tauriello, Gerardo, Carpenter, Zachary, Bronstein, Michael, Kucukbenli, Emine, Schwede, Torsten, Naef, Luca · 2024 · bioRxiv (Cold Spring Harbor Laboratory)
PreprintCited by 75

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

Abstract

Protein-ligand interactions (PLI) are foundational to small molecule drug design. With computational methods striving towards experimental accuracy, there is a critical demand for a well-curated and diverse PLI dataset. Existing datasets are often limited in size and diversity, and commonly used evaluation sets suffer from training information leakage, hindering the realistic assessment of method generalization capabilities. To address these shortcomings, we present PLIN-DER, the largest and most annotated dataset to date, comprising 449,383 PLI systems, each with over 500 annotations, similarity metrics at protein, pocket, interaction and ligand levels, and paired unbound ( apo ) and predicted structures. We propose an approach to generate training and evaluation splits that minimizes task-specific leakage and maximizes test set quality, and compare the resulting performance of DiffDock when retrained with different kinds of splits.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1101/2024.07.17.603955

Cites

12 of 12 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Show all 12 references

Research works printed but not linked: 33

  1. 10.1093/nar/gkab294 · DOI · Paper page
  2. Angriman, E. , van der Grinten, A. , Hamann, M. , Meyerhenke, H. , and Penschuck, M. Algorithms for large-scale network analysis and the networkit toolkit. In Algorithms for Big Data: DFG Priority Program 1736, pp. 3–20. Springer Nature Switzerland Cham, 2023. · DOI
  3. 10.1093/nar/28.1.235 · DOI · Paper page
  4. 10.1107/S0907444913007051 · DOI · Paper page
  5. 2012, Quantifying the chemical beauty of drugs, Nature chemistry, 4, 90, 10.1038/nchem.1243 · DOI · Paper page
  6. 10.1039/D3SC04185A · DOI · Paper page
  7. Chawdhury, T. K. , Grant, D. J. , and Jin, H. Y. Deep2lead: A distributed deep learning application for small molecule lead optimization, 2021. URL https://arxiv.org/abs/2108.05183. · arXiv · doi:10.20935/al2925
  8. 10.1107/S0907444909042073 · DOI · Paper page
  9. 10.1101/2023.10.24.563739 · doi:10.1101/2023.10.24.563739
  10. Corso, G. , Stärk, H. , Jing, B. , Barzilay, R. , and Jaakkola, T. Diffdock: Diffusion steps, twists, and turns for molecular docking, 2023. URL https://arxiv.org/abs/2210.01776. · arXiv
  11. Corso, G. , Deng, A. , Fry, B. , Polizzi, N. , Barzilay, R. , and Jaakkola, T. Deep confident steps to new pockets: Strategies for docking generalization, 2024. URL https://arxiv.org/abs/2402.18396. · arXiv
  12. 10.1101/2023.12.22.573103 · DOI
  13. 10.1002/bip.22434 · DOI
  14. 10.12688/f1000research.8357.2 · doi:10.12688/f1000research.8357.2
  15. 10.1093/nar/gkaa895 · DOI · Paper page
  16. 2023, Automated benchmarking of combined protein structure and ligand conformation prediction, Proteins: Structure, Function, and Bioinformatics, 91, 1912, 10.1002/prot.26605 · DOI · Paper page
  17. Li, J. , Guan, X. , Zhang, O. , Sun, K. , Wang, Y. , Bagni, D. , and Head-Gordon, T. Leak proof pdbbind: A reorganized dataset of protein-ligand complexes for more generalizable binding affinity prediction, 2024. URL https://arxiv.org/html/2308.09639v2.
  18. 10.1093/bioinformatics/btu626 · DOI · Paper page
  19. 10.1101/2022.06.06.495043 · DOI
  20. 10.1006/jmbi.1995.0159 · DOI
  21. 10.1186/1752-153X-2-5 · DOI · Paper page
  22. 10.1016/S0969-2126(97)00260-8 · DOI · Paper page
  23. 2020, Measurement of atom resolvability in cryo-em maps with q-scores, Nature methods, 17, 328, 10.1038/s41592-020-0731-1 · DOI · Paper page
  24. Plainer, M. , Toth, M. , Dobers, S. , Stark, H. , Corso, G. , Marquet, C. , and Barzilay, R. Diffdock-pocket: Diffusion for pocket-level docking with sidechain flexibility. In NeurIPS 2023 Workshop on New Frontiers of AI for Drug Discovery and Development, 2023. URL https://openreview.net/forum?id=5Wt7qNRc5u.
  25. 10.1038/s42256-024-00792-z · DOI · Paper page
  26. 2023, Assessment of protein–ligand complexes in casp15, Proteins: Structure, Function, and Bioinformatics, 91, 1811, 10.1002/prot.26601 · DOI · Paper page
  27. 10.1002/prot.26612 · DOI · Paper page
  28. Stärk, H. , Ganea, O. , Pattanaik, L. , Barzilay, R. , and Jaakkola, T. Equibind: Geometric deep learning for drug binding structure prediction, 2022. URL https://arxiv.org/abs/2202.05146. · arXiv
  29. 10.1101/2024.03.14.585019 · DOI · Paper page
  30. 10.1016/j.drudis.2012.06.011 · DOI · Paper page
  31. 10.1093/bioinformatics/btu789 · DOI · Paper page
  32. 10.1021/ci990307l · DOI · Paper page
  33. 10.1093/nar/gkad630 · DOI · Paper page

Cited by

Metadata

Authors
Durairaj, J., Adeshina, Y., Cao, Z., Zhang, X., Oleinikovas, V., Duignan, T., McClure, Z., Robin, X., Studer, G., Kovtun, D., Rossi, E., Zhou, G., Veccham, S., Isert, C., Peng, Y., Sundareson, P., Akdel, M., Corso, G., Stärk, H., Tauriello, G., Carpenter, Z., Bronstein, M., Kucukbenli, E., Schwede, T., & Naef, L.
Venue
bioRxiv (Cold Spring Harbor Laboratory)
Publisher
openRxiv
Published
2024-07-17
OpenAlex
W4400795417
Cited by
75
References
12
Type
posted content
Language
en
Open access
green

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.