bioRxivBiochemistry
Efficient Hit-to-Lead Searching of Kinase Inhibitor Chemical Space via Computational Fragment Merging
G. V. Andrianov, W. J. G. Ong, I. Serebriiskii, J. Karanicolas
Abstract
In early stage drug discovery, the hit-to-lead optimization (or "hit expansion") stage entails starting from a newly-identified active compound, and improving its potency or other properties. Traditionally this process relies on synthesizing and evaluating a series of analogs to build up structure-activity relationships. Here, we describe a computational strategy focused on kinase inhibitors, intended to expedite the process of identifying analogs with improved potency. Our protocol begins from an inhibitor of the target kinase, and generalizes the synthetic route used to access it. By searching for commercially-available replacements for the individual building blocks used to make the parent inhibitor, we compile an enumerated library of compounds that can be accessed using the same chemical transformations; these huge libraries can exceed many millions - or billions - of compounds. Because the resulting libraries are much too large for explicit virtual screening, we instead consider alternate approaches to identify the top-scoring compounds. We find that contributions from individual substituents are well-described by a pairwise additivity approximation, provided that the corresponding fragments position their shared core in precisely the same way relative to the binding site. This key insight allows us to determine which fragments are suitable for merging into a single new compounds, and which are not. Further, the use of the pairwise approximation allows interaction energies to be assigned to each compound in the library, without the need for any further structure-based modeling: interaction energies instead can be reliably estimated from the energies of the component fragments, and the reduced computational requirements allow for flexible energy minimizations that allow the kinase to respond to each substitution. We demonstrate this protocol using libraries built from six representative kinase inhibitors drawn from the literature, which target five different kinases: CDK9, CHK1, CDK2, EGFRT790M, and ACK1. In each example, the enumerated library includes additional analogs reported by the original study to have activity, and these analogs are successfully prioritized within the library. We envision that the insights from this work can facilitate the rapid assembly and screening of increasingly large libraries for focused hit-to-lead optimization. To enable adoption of these methods and to encourage further analyses, we disseminate the computational tools needed to deploy this protocol. Graphical Abstract O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=85 SRC="FIGDIR/small/446684v2_ufig1.gif" ALT="Figure 1"> View larger version (15K): org.highwire.dtl.DTLVardef@1ccdd9aorg.highwire.dtl.DTLVardef@e8b7b8org.highwire.dtl.DTLVardef@75a4fcorg.highwire.dtl.DTLVardef@1a2da2c_HPS_FORMAT_FIGEXP M_FIG C_FIG
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- KinaFrag explores the kinase-ligand fragment interaction space for selective kinase inhibitor discovery
Zhi-Zheng Wang, Xing-Xing Shi, … Guang‐Fu Yang·bioRxiv·Mar 28, 2021
- Natural Product-Like Fragments Unlock Novel Chemotypes for a Kinase Target - Exploring Options beyond the Flatland
Anna Santura, Janis Müller, … Paul Czodrowski·bioRxiv·Jun 11, 2025
- Expanding the scope of a catalogue search to bioisosteric fragment merges using a graph database approach
Stephanie Wills, Rubén Sánchez-García, … Charlotte Mary Deane·bioRxiv·Aug 2, 2024
- Crowdsourced mapping of unexplored target space of kinase inhibitors
A. Cichonska, B. Ravikumar, … T. Aittokallio·bioRxiv·Dec 31, 2019
- Predicting kinase inhibitors using bioactivity matrix derived informer sets
H. Zhang, S. S. Ericksen, … M. A. Newton·bioRxiv·Jan 28, 2019
- The use of a graph database is a complementary approach to a classical similarity search for identifying commercially available fragment merges
Stephanie Wills, Rubén Sánchez-García, … Charlotte Mary Deane·Journal of Chemical Information and ModelingPeer-reviewed·May 25, 2023