Abstract
Allostery plays a primary role in regulating protein activity, making it an important mechanism in human disease and drug discovery. Identifying allosteric regulatory sites to explore their biological significance and therapeutic potential is invaluable to drug discovery; however, identification remains a challenge. Allosteric sites are often “cryptic” without clear geometric or chemical features. Since allosteric regulatory sites are often less conserved in protein kinases than the orthosteric ATP binding site, allosteric ligands are commonly more specific than ATP competitive inhibitors. We present a generalizable computational protocol to predict allosteric ligand binding sites based on unbiased ligand binding simulation trajectories. We demonstrate the feasibility of this protocol by revisiting our previously published ligand binding simulations using the first identified viral proto-oncogene, Src kinase, as a model system. The binding paths for kinase inhibitor PP1 uncovered three metastable intermediate states before binding the high-affinity ATP-binding pocket, revealing two previously known allosteric sites and one novel site. Herein, we validate the novel site using a combination of virtual screening and experimental assays to identify a V-type allosteric small-molecule inhibitor that targets this novel site with specificity for Src over closely related kinases. This study provides a proof-of-concept for employing unbiased ligand binding simulations to identify cryptic allosteric binding sites and is widely applicable to other protein–ligand systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.