Persistent spectral hypergraph based machine learning (PSH-ML) for protein-ligand binding affinity prediction
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Molecular descriptors are essential to not only quantitative structure activity/property relationship (QSAR/QSPR) models, but also machine learning based chemical and biological data analysis. In this paper, we propose persistent spectral hypergraph (PSH) based molecular descriptors or fingerprints for the first time. Our PSH-based molecular descriptors are used in the characterization of molecular structures and interactions, and further combined with machine learning models, in particular gradient boosting tree (GBT), for protein-ligand binding affinity prediction. Different from traditional molecular descriptors, which are usually based on molecular graph models, a hypergraph-based topological representation is proposed for protein–ligand interaction characterization. Moreover, a filtration process is introduced to generate a series of nested hypergraphs in different scales. For each of these hypergraphs, its eigen spectrum information can be obtained from the corresponding (Hodge) Laplacain matrix. PSH studies the persistence and variation of the eigen spectrum of the nested hypergraphs during the filtration process. Molecular descriptors or fingerprints can be generated from persistent attributes, which are statistical or combinatorial functions of PSH, and combined with machine learning models, in particular, GBT. We test our PSH-GBT model on three most commonly used datasets, including PDBbind-2007, PDBbind-2013 and PDBbind-2016. Our results, for all these databases, are better than all existing machine learning models with traditional molecular descriptors, as far as we know.
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.
Integrity signals
Registry
Cites
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.
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
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Molecular graph convolutions: moving beyond fingerprints
Kearnes, S., McCloskey, K., Berndl, M., Pande, V., & Riley, P. (2016) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-016-9938-8 · Cited by 1,631 · cited 1×
“Molecular graph convolutions with only features of atom type, bond type and graph distance have been found to achieve comparable results with deep learning models using more complicated handcrafted features [13].”
ResultZomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Machine learning in chemoinformatics and drug discovery
Lo, Y.-C., Rensi, S. E., Torng, W., & Altman, R. B. (2018) · Drug Discovery Today · doi:10.1016/j.drudis.2018.05.010 · Cited by 960
Tsubaki, M., Tomii, K., & Sese, J. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty535 · Cited by 688 · cited 1×
“To design an end-to-end representation learning model, a combination framework of compound SMILES-sequence based GCN model and protein sequence-based CNN model has been introduced for the prediction of compound–protein interactions [15].”
MethodHow artificial intelligence is changing drug discovery
Fleming, N. (2018) · Nature · doi:10.1038/d41586-018-05267-x · Cited by 546 · cited 3×
“Currently, to develop one new market-approval prescription medicine takes more than 10 years and costs about $2.6 billion [1].”
BackgroundInfluentialConvolutional embedding of attributed molecular graphs for physical property prediction
Coley, C. W., Barzilay, R., Green, W. H., Jaakkola, T. S., & Jensen, K. F. (2017) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6b00601 · Cited by 470
Boosting docking-based virtual screening with deep learning.
Pereira, J. C., Caffarena, E. R., & dos Santos, C. N. (2016) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6b00355 · Cited by 395
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330 · cited 5×
“…with learning models have achieved great success in various steps of drug design, including protein-ligand (PL) binding affinity prediction [33, 36–39], protein stability change upon mutation prediction [35, 40], toxicity prediction [41], solvation free energy prediction [42, 43],…”
BackgroundMethodInfluentialCang, Z., Mu, L., & Wei, G.-W. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005929 · Cited by 257 · cited 5×
“…steps of drug design, including protein-ligand (PL) binding affinity prediction [33, 36–39], protein stability change upon mutation prediction [35, 40], toxicity prediction [41], solvation free energy prediction [42, 43], partition coefficient and aqueous solubility [44], binding pocket…”
BackgroundMethodInfluential
Cited by
AI in drug discovery and its clinical relevance
Qureshi, R., Irfan, M., Gondal, T. M., Khan, S., Wu, J., Hadi, M. U., Heymach, J., Le, X., Yan, H., & Alam, T. (2023) · Heliyon · doi:10.1016/j.heliyon.2023.e17575 · Cited by 319
“The use of hypergraph, persistent homology, and machine learning to predict the binding affinity is presented in [105].”
Self-citationDeep learning methods for molecular representation and property prediction
Li, Z., Jiang, M., Wang, S., & Zhang, S. (2022) · Drug Discovery Today · doi:10.1016/j.drudis.2022.103373 · Cited by 279
Protein p K a Prediction by Tree-Based Machine Learning
Chen, A. Y., Lee, J., Damjanovic, A., & Brooks, B. R. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01257 · Cited by 37
Zhang, S., Xie, L., Tiourine, D., & Xie, L. (2026) · Journal of Cheminformatics · doi:10.1186/s13321-026-01227-0 · Cited by 2
Metadata
- Authors
- Liu, X., Feng, H., Wu, J., & Xia, K.
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2021-04-09
- Volume
- 22
- Issue
- 5
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W3140655290
- Cited by
- 60
- References
- 17
- FWCI
- 4.75
- Type
- journal article
- Language
- en
- Open access
- closed
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.