Cited by 418Computational Drug Discovery MethodsChemical Synthesis and AnalysisSynthesis and Characterization of Heterocyclic Compounds

Synthon-based ligand discovery in virtual libraries of over 11 billion compounds

Open access
Sadybekov, Arman A., Sadybekov, Anastasiia V., Liu, Yongfeng, Iliopoulos-Tsoutsouvas, Christos, Huang, Xi-Ping, Pickett, Julie, Houser, Blake, Patel, Nilkanth +12 more·2022·Nature

Abstract

Structure-based virtual ligand screening is emerging as a key paradigm for early drug discovery owing to the availability of high-resolution target structures 1-4 and ultra-large libraries of virtual compounds 5,6. However, to keep pace with the rapid growth of virtual libraries, such as readily available for synthesis (REAL) combinatorial libraries 7, new approaches to compound screening are needed 8,9. Here we introduce a modular synthon-based approach-V-SYNTHES-to perform hierarchical structure-based screening of a REAL Space library of more than 11 billion compounds. V-SYNTHES first identifies the best scaffold-synthon combinations as seeds suitable for further growth, and then iteratively elaborates these seeds to select complete molecules with the best docking scores. This hierarchical combinatorial approach enables the rapid detection of the best-scoring compounds in the gigascale chemical space while performing docking of only a small fraction (<0.1%) of the library compounds. Chemical synthesis and experimental testing of novel cannabinoid antagonists predicted by V-SYNTHES demonstrated a 33% hit rate, including 14 submicromolar ligands, substantially improving over a standard virtual screening of the Enamine REAL diversity subset, which required approximately 100 times more computational resources. Synthesis of selected analogues of the best hits further improved potencies and affinities (best inhibitory constant (K i) = 0.9 nM) and CB 2/CB 1 selectivity (50-200-fold). V-SYNTHES was also tested on a kinase target, ROCK1, further supporting its use for lead discovery. The approach is easily scalable for the rapid growth of combinatorial libraries and potentially adaptable to any docking algorithm.

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.

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

Integrity signals

Registry

Crossref · 10.1038/s41586-021-04220-9

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

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.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A 100-fold acceleration of docking was observed by docking a fraction of the chemical library in synchrony with an AI/ML ligand-based prediction of the remaining docking scores.

    “For example, a 100-fold acceleration of the process was observed by docking a fraction of the chemical library in synchrony with an AI/ML ligand-based prediction of the remaining docking scores.144”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sadybekov, A. A., Sadybekov, A. V., Liu, Y., Iliopoulos-Tsoutsouvas, C., Huang, X.-P., Pickett, J., Houser, B., Patel, N., Tran, N. K., Tong, F., Zvonok, N., Jain, M. K., Savych, O., Radchenko, D. S., Nikas, S. P., Petasis, N. A., Moroz, Y. S., Roth, B. L., Makriyannis, A., & Katritch, V.
Affiliations
  • University of Southern California (US)
  • University of North Carolina at Chapel Hill (US)
  • Northeastern University (US)
  • Enamine (Ukraine) (UA)
  • Taras Shevchenko National University of Kyiv (UA)
Corresponding author
  • Roth, Bryan L.
  • Makriyannis, Alexandros
  • Katritch, Vsevolod
Venue
Nature
Published
2021-12-15
Volume
601
Issue
7893
Pages
452-459
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4200233821
Cited by
417
References
43
Citations by year
2026: 65 · 2025: 96 · 2024: 119 · 2023: 88 · 2022: 46 · 2021: 2
FWCI
33.74
Type
journal article
Language
en
Open access
Locations
  • Nature (publishedVersion)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • Carolina Digital Repository (University of North Carolina at Chapel Hill) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • UNC Libraries
Funders
  • National Institute of Mental Health (R01MH112205)
  • National Institute on Drug Abuse (R01DA041435, R01DA045020, R37DA045657)
  • National Institute of General Medical Sciences (GM118289, T32GM118289)
  • National Institute of Diabetes and Digestive and Kidney Diseases (U24DK116195)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Chemical Synthesis and Analysis
  • Physical Sciences › Chemistry › Organic Chemistry › Synthesis and Characterization of Heterocyclic Compounds
Keywords
structure-based virtual screening, cannabinoid receptor antagonists, cannabinoid receptor ligands, lead compound identification
MeSH terms
Algorithms, Ligands, Combinatorial Chemistry Techniques, Libraries, Digital, rho-Associated Kinases, Drug Discovery, Molecular Docking Simulation

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