Structural Genomics Consortium, University of Toronto, Toronto, Ontario M5G 1L7, Canada.
Medical Biophysics, University of Toronto, Toronto, Ontario M5G 1L7, Canada.
J Chem Inf Model. 2024 Nov 25;64(22):8521-8536. doi: 10.1021/acs.jcim.4c01267. Epub 2024 Nov 5.
The CACHE challenges are a series of prospective benchmarking exercises to evaluate progress in the field of computational hit-finding. Here we report the results of the inaugural CACHE challenge in which 23 computational teams each selected up to 100 commercially available compounds that they predicted would bind to the WDR domain of the Parkinson's disease target LRRK2, a domain with no known ligand and only an apo structure in the PDB. The lack of known binding data and presumably low druggability of the target is a challenge to computational hit finding methods. Of the 1955 molecules predicted by participants in Round 1 of the challenge, 73 were found to bind to LRRK2 in an SPR assay with a K lower than 150 μM. These 73 molecules were advanced to the Round 2 hit expansion phase, where computational teams each selected up to 50 analogs. Binding was observed in two orthogonal assays for seven chemically diverse series, with affinities ranging from 18 to 140 μM. The seven successful computational workflows varied in their screening strategies and techniques. Three used molecular dynamics to produce a conformational ensemble of the targeted site, three included a fragment docking step, three implemented a generative design strategy and five used one or more deep learning steps. CACHE #1 reflects a highly exploratory phase in computational drug design where participants adopted strikingly diverging screening strategies. Machine learning-accelerated methods achieved similar results to brute force (e.g., exhaustive) docking. First-in-class, experimentally confirmed compounds were rare and weakly potent, indicating that recent advances are not sufficient to effectively address challenging targets.
CACHE 挑战赛是一系列旨在评估计算命中发现领域进展的前瞻性基准测试。在这里,我们报告了首次 CACHE 挑战赛的结果,在该挑战赛中,23 个计算团队各自选择了多达 100 种商业上可获得的化合物,这些化合物据预测将与帕金森病靶标 LRRK2 的 WDR 结构域结合,该结构域没有已知的配体,只有 PDB 中的无配体的 apo 结构。缺乏已知的结合数据和推测的靶标低成药性是计算命中发现方法的挑战。在挑战赛第一轮中,有 1955 个分子被预测,其中 73 个在 SPR 测定中与 LRRK2 结合,其 K 值低于 150 μM。这 73 个分子被推进到第二轮命中扩展阶段,在该阶段,计算团队各自选择了多达 50 个类似物。在两个正交测定中观察到七个化学多样性系列的结合,亲和力范围为 18 至 140 μM。七个成功的计算工作流程在其筛选策略和技术上有所不同。其中三个使用分子动力学产生靶向位点的构象组合,三个包括片段对接步骤,三个实施生成设计策略,五个使用一个或多个深度学习步骤。CACHE#1 反映了计算药物设计中高度探索性的阶段,参与者采用了截然不同的筛选策略。机器学习加速的方法与暴力(例如,穷举)对接取得了相似的结果。首次获得的、经实验证实的化合物很少且效力较弱,这表明最近的进展不足以有效地解决具有挑战性的靶标。