Using Guided Motion Planning to Study Binding Site Accessibility

Computational methods are commonly used to predict protein-ligand interactions. These methods typically search for regions with favorable energy that geometrically fit the ligand, and then rank them as potential binding sites. While this general strategy can provide good predictions in some cases, it does not do well when the binding site is not accessible to the ligand. In addition, recent research has shown that in some cases protein access tunnels play a major role in the activity and stability of the protein's binding interactions. Hence, to fully understand the binding behavior of such proteins, it is imperative to identify and study their access tunnels. In this work, we present a motion planning algorithm that scores protein binding site accessibility for a particular ligand. This method can be used to screen ligand candidates for a protein by eliminating those that cannot access the binding site. This method was tested on two case studies to analyze effects of modifying a protein's access tunnels to increase activity and/or stability as well as study how a ligand inhibitor blocks access to the protein binding site.

[1]  R. Nussinov,et al.  Protein–protein interactions: Structurally conserved residues distinguish between binding sites and exposed protein surfaces , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Nancy M. Amato,et al.  Topological Nearest-Neighbor Filtering for Sampling-Based Planners , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[3]  Conrad C. Huang,et al.  UCSF Chimera—A visualization system for exploratory research and analysis , 2004, J. Comput. Chem..

[4]  Nancy M. Amato,et al.  Ligand Binding with OBPRM and Haptic User Input: Enhancing Automatic Motion Planning with Virtual Touch , 2000 .

[5]  Eva Sebestova,et al.  Balancing the Stability–Activity Trade‐Off by Fine‐Tuning Dehalogenase Access Tunnels , 2015 .

[6]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[7]  Rahul Kala,et al.  Rapidly exploring random graphs: motion planning of multiple mobile robots , 2013, Adv. Robotics.

[8]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9]  Yu Li,et al.  Identification of cavities on protein surface using multiple computational approaches for drug binding site prediction , 2011, Bioinform..

[10]  Dusanka Janezic,et al.  ProBiS-CHARMMing: Web Interface for Prediction and Optimization of Ligands in Protein Binding Sites , 2015, J. Chem. Inf. Model..

[11]  Antonín Pavelka,et al.  CAVER: Algorithms for Analyzing Dynamics of Tunnels in Macromolecules , 2016, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[12]  Radka Chaloupkova,et al.  Crystallographic analysis of 1,2,3-trichloropropane biodegradation by the haloalkane dehalogenase DhaA31. , 2014, Acta crystallographica. Section D, Biological crystallography.

[13]  Jan Brezovsky,et al.  Engineering enzyme stability and resistance to an organic cosolvent by modification of residues in the access tunnel. , 2013, Angewandte Chemie.

[14]  Nancy M. Amato,et al.  Dynamic Region-biased Rapidly-exploring Random Trees , 2016, WAFR.

[15]  A. Onufriev,et al.  Protein-Ligand Electrostatic Binding Free Energies from Explicit and Implicit Solvation. , 2015, Journal of chemical theory and computation.

[16]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[17]  Zbynek Prokop,et al.  Pathways and mechanisms for product release in the engineered haloalkane dehalogenases explored using classical and random acceleration molecular dynamics simulations. , 2009, Journal of molecular biology.

[18]  Barbora Kozlíková,et al.  Tunnel detection in protein structures using sampling-based motion planning , 2017, 2017 11th International Workshop on Robot Motion and Control (RoMoCo).

[19]  Zbynek Prokop,et al.  Engineering enzyme access tunnels. , 2019, Biotechnology advances.

[20]  David S. Goodsell,et al.  AutoDockFR: Advances in Protein-Ligand Docking with Explicitly Specified Binding Site Flexibility , 2015, PLoS Comput. Biol..

[21]  Mallur S. Madhusudhan,et al.  Depth: a web server to compute depth, cavity sizes, detect potential small-molecule ligand-binding cavities and predict the pKa of ionizable residues in proteins , 2013, Nucleic Acids Res..

[22]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[23]  Andrea Tagliasacchi,et al.  Mean Curvature Skeletons , 2012, Comput. Graph. Forum.

[24]  Jean-Claude Latombe,et al.  A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.

[25]  Hongbo Zhu,et al.  MSPocket: an orientation-independent algorithm for the detection of ligand binding pockets , 2011, Bioinform..

[26]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[27]  Jan Brezovsky,et al.  Impact of the access tunnel engineering on catalysis is strictly ligand‐specific , 2018, The FEBS journal.

[28]  Didier Devaurs,et al.  MoMA-LigPath: a web server to simulate protein–ligand unbinding , 2013, Nucleic Acids Res..

[29]  J. Damborský,et al.  Atomic resolution studies of haloalkane dehalogenases DhaA04, DhaA14 and DhaA15 with engineered access tunnels. , 2010, Acta crystallographica. Section D, Biological crystallography.

[30]  Shunqi Yan,et al.  Isothiazoles as active-site inhibitors of HCV NS5B polymerase. , 2006, Bioorganic & medicinal chemistry letters.

[31]  Brian Y. Chen,et al.  VASP-E: Specificity Annotation with a Volumetric Analysis of Electrostatic Isopotentials , 2014, PLoS Comput. Biol..

[32]  M. Schroeder,et al.  LIGSITEcsc: predicting ligand binding sites using the Connolly surface and degree of conservation , 2006, BMC Structural Biology.

[33]  Charles A. Lesburg,et al.  Crystal structure of the RNA-dependent RNA polymerase from hepatitis C virus reveals a fully encircled active site , 1999, Nature Structural Biology.

[34]  Thomas E. Ferrin,et al.  Computer graphics in real‐time docking with energy calculation and minimization , 1985 .