Article
作者: Zheng, Shuangjia ; Chau, Irene ; Roskams-Edris, Dylan ; Lu, Wei ; Gusev, Filipp ; Jacquemard, Celien ; Gentile, Francesco ; Obendorf, Leon ; Chen, Yu ; Dong, Aiping ; Ivanova, Aleksandra ; Sindt, François ; Bolotokova, Albina ; Ban, Fuqiang ; Rognan, Didier ; Barden, Christopher J. ; Zeng, Hong ; Cherkasov, Artem ; Gutkin, Evgeny ; Beránek, Jan ; Walters, W. Patrick ; Polishchuk, Pavel ; Friedrich, Lukas ; Hillisch, Alexander ; Isayev, Olexandr ; Kurnikova, Maria G. ; Hoffer, Laurent ; Bret, Guillaume ; Gardiner, Spencer S ; Wang, Zhenyu ; Pütter, Vera ; Carosati, Emanuele ; Glavatskikh, Marta ; Pandit, Amit ; Gibson, Elisa ; Halabelian, Levon ; Zhang, Kam Y. J. ; Eisenhuth, Paul ; Vu, Oanh ; Edwards, Aled ; Beck, Hartmut ; Pach, Szymon ; Gunnarsson, Anders ; Mettu, Akhila ; Lessel, Uta ; Talagayev, Valerij ; Edfeldt, Kristina ; Puls, Kristina ; Kleber, Julian ; Morris, Connor J ; Narangoda, Chamali ; Li, Fengling ; Arrowsmith, Cheryl H. ; Liu, Sijie ; Schindler, Christina ; Breznik, Marko ; Kireev, Dmitri ; Kutlushina, Alina ; Perveen, Sumera ; Liessmann, Fabian ; Harding, Rachel J. ; Meiler, Jens ; Ackloo, Suzanne ; Schapira, Matthieu ; Koes, David ; Kumar, Ashutosh ; Eguida, Merveille ; Guenther, Judith ; Wolf, Clemens Alexander ; Wolber, Gerhard ; Steinmann, Casper ; Stevens, Rick L. ; Jensen, Jan H. ; Noonan, Theresa ; Wang, Xiaowen ; Hogner, Anders ; Minibaeva, Guzel ; Tingey, Damon ; Moretti, Rocco ; Fuerll, Alexander ; Koby, S. Benjamin ; Zhang, Jixian ; Poda, Gennady ; Gorgulla, Christoph ; Corte, Dennis Della ; Spiwok, Vojtěch ; Berenger, Francois ; Jarrett, Austin J ; Irwin, John J ; Dunn, Ian ; Ghiabi, Pegah ; Denzinger, Katrin ; Draga, Sorin ; Houliston, Scott ; Zepeda, Carlos A. ; Wortmann, Lars
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 KD 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.