Combining fragment docking with graph theory to improve ligand docking for homology model structures

Computational protein–ligand docking is well-known to be prone to inaccuracies in input receptor structures, and it is challenging to obtain good docking results with computationally predicted receptor structures (e.g. through homology modeling). Here we introduce a fragment-based docking method and test if it reduces requirements on the accuracy of an input receptor structures relative to non-fragment docking approaches. In this method, small rigid fragments are docked first using AutoDock Vina to generate a large number of favorably docked poses spanning the receptor binding pocket. Then a graph theory maximum clique algorithm is applied to find combined sets of docked poses of different fragment types onto which the complete ligand can be properly aligned. On the basis of these alignments, possible binding poses of complete ligand are determined. This docking method is first tested for bound docking on a series of Cytochrome P450 (CYP450) enzyme–substrate complexes, in which experimentally determined receptor structures are used. For all complexes tested, ligand poses of less than 1 Å root mean square deviations (RMSD) from the actual binding positions can be recovered. Then the method is tested for unbound docking with modeled receptor structures for a number of protein–ligand complexes from different families including the very recent severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) protease. For all complexes, poses with RMSD less than 3 Å from actual binding positions can be recovered. Our results suggest that for docking with approximately modeled receptor structures, fragment-based methods can be more effective than common complete ligand docking approaches. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1007/s10822-020-00345-7) contains supplementary material, which is available to authorized users.