CANDOCK: Chemical atomic network based hierarchical flexible docking algorithm using generalized statistical potentials Jonathan Fine1, ‡, Janez Konc2, ‡, Ram Samudrala3, Gaurav Chopra1,4,5,6,7 * 1Department of Chemistry, Purdue University, 720 Clinic Drive, West Lafayette, IN 47906 2National Institute of Chemistry, Hajdrihova 19, SI−1000, Ljubljana, Slovenia 3Department of Biomedical Informatics, SUNY, Buffalo, NY, USA 4Purdue Institute for Drug Discovery 5Purdue Center for Cancer Research 6Purdue Institute for Inflammation, Immunology and Infectious Disease 7Purdue Institute for Integrative Neuroscience ‡These authors share equal contribution to this work. *Corresponding Author E-mail:
[email protected] Abstract Small molecule docking has proven to be invaluable for drug design and discovery. However, existing docking methods have several limitations, such as, ignoring interactions with essential components in the chemical environment of the binding pocket (e.g. cofactors, metal-ions, etc.), incomplete sampling of chemically relevant ligand conformational space, and they are unable to consistently correlate docking scores of the best binding pose with experimental binding affinities. We present CANDOCK, a novel docking algorithm that utilizes a hierarchical approach to reconstruct ligands from an atomic grid using graph theory and generalized statistical potential functions to sample chemical relevant ligand conformations. Our algorithm accounts for protein flexibility, solvent, metal ions and cofactors interactions in the binding pocket that are traditionally ignored by current methods. We evaluate the algorithm on the PDBbind and Astex proteins to show its ability to reproduce the binding mode of the ligands that is independent of the initial ligand conformation in these benchmarks. Finally, we identify the best selector and ranker potential functions, such that, the statistical score of best selected docked pose correlates with the experimental binding affinities of the ligands for any given protein target.