The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
AGL-Score: Algebraic Graph Learning Score for Protein–Ligand Binding Scoring, Ranking, Docking, and Screening
Open accessAbstract
Although algebraic graph theory-based models have been widely applied in physical modeling and molecular studies, they are typically incompetent in the analysis and prediction of biomolecular properties, confirming the common belief that "one cannot hear the shape of a drum". A new development in the century-old question about the spectrum-geometry relationship is provided. Novel algebraic graph learning score (AGL-Score) models are proposed to encode high-dimensional physical and biological information into intrinsically low-dimensional representations. The proposed AGL-Score models employ multiscale weighted colored subgraphs to describe crucial molecular and biomolecular interactions in terms of graph invariants derived from graph Laplacian, its pseudo-inverse, and adjacency matrices. Additionally, AGL-Score models are integrated with an advanced machine learning algorithm to predict biomolecular macroscopic properties from the low-dimensional graph representation of biomolecular structures. The proposed AGL-Score models are extensively validated for their scoring power, ranking power, docking power, and screening power via a number of benchmark datasets, namely CASF-2007, CASF-2013, and CASF-2016. Numerical results indicate that the proposed AGL-Score models are able to outperform other state-of-the-art scoring functions in protein-ligand binding scoring, ranking, docking, and screening. This study indicates that machine learning methods are powerful tools for molecular docking and virtual screening. It also indicates that spectral geometry or spectral graph theory has the ability to infer geometric properties.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Trott, O., & Olson, A. J. (2010) · Journal of Computational Chemistry · doi:10.1002/jcc.21334 · Cited by 38,412
Development and validation of a genetic algorithm for flexible docking 1 1Edited by F. E. Cohen
Jones, G., Willett, P., Glen, R. C., Leach, A. R., & Taylor, R. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0897 · Cited by 6,763
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
MoleculeNet: a benchmark for molecular machine learning
Wu, Z., Ramsundar, B., Feinberg, E. N., Gomes, J., Geniesse, C., Pappu, A. S., Leswing, K., & Pande, V. (2018) · Chemical Science · doi:10.1039/c7sc02664a · Cited by 3,107
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
Self-citationCang, Z., Mu, L., & Wei, G.-W. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005929 · Cited by 257
Self-citationLi, H., Leung, K., Wong, M., & Ballester, P. J. (2015) · Molecular Informatics · doi:10.1002/minf.201400132 · Cited by 252
Cang, Z., & Wei, G. (2018) · International Journal for Numerical Methods in Biomedical Engineering · doi:10.1002/cnm.2914 · Cited by 172
Self-citation
Cited by
Machine-learning methods for ligand–protein molecular docking
Crampon, K., Giorkallos, A., Deldossi, M., Baud, S., & Steffenel, L. A. (2022) · Drug Discovery Today · doi:10.1016/j.drudis.2021.09.007 · Cited by 388
Zheng, L., Fan, J., & Mu, Y. (2019) · ACS Omega · doi:10.1021/acsomega.9b01997 · Cited by 338
Deep 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
(2024) · doi:10.1038/s42256-024-00855-1 · Cited by 57
A new paradigm for applying deep learning to protein–ligand interaction prediction
Wang, Z., Wang, S., Li, Y., Guo, J., Wei, Y., Mu, Y., Zheng, L., & Li, W. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae145 · Cited by 41
Metadata
- Authors
- Nguyen, D. D., & Wei, G.-W.
- Venue
- Journal of Chemical Information and Modeling
- Publisher
- American Chemical Society (ACS)
- Published
- 2019-06-18
- Volume
- 59
- Issue
- 7
- Pages
- 3291-3304
- ISSN
- 1549-9596 (ISSN-L)
- 1549-960X
- OpenAlex
- W2951676304
- Cited by
- 221
- References
- 13
- FWCI
- 17.19
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: AGL-Score: Algebraic Graph Learning Score for Protein–Ligand Binding Scoring, Ranking, Docking, and Screening. https://app.cochat.ai/papers/10.1021/acs.jcim.9b00334
- The paper
- Nguyen, D. D., & Wei, G.-W. (2019). AGL-Score: Algebraic Graph Learning Score for Protein–Ligand Binding Scoring, Ranking, Docking, and Screening. Journal of Chemical Information and Modeling. https://doi.org/10.1021/acs.jcim.9b00334
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.