Electrostatics in protein–protein docking

A novel geometric‐electrostatic docking algorithm is presented, which tests and quantifies the electrostatic complementarity of the molecular surfaces together with the shape complementarity. We represent each molecule to be docked as a grid of complex numbers, storing information regarding the shape of the molecule in the real part and information regarding the electrostatic character of the molecule in the imaginary part. The electrostatic descriptors are derived from the electrostatic potential of the molecule. Thus, the electrostatic character of the molecule is represented as patches of positive, neutral, or negative values. The potential for each molecule is calculated only once and stored as potential spheres adequate for exhaustive rotation/translation scans. The geometric‐electrostatic docking algorithm is applied to 17 systems, starting form the structures of the unbound molecules. The results—in terms of the complementarity scores of the nearly correct solutions, their ranking in the lists of sorted solutions, and their statistical uniqueness—are compared with those of geometric docking, showing that the inclusion of electrostatic complementarity in docking is very important, in particular in docking of unbound structures. Based on our results, we formulate several “good electrostatic docking rules”: The geometric‐electrostatic docking procedure is more successful than geometric docking when the potential patches are large and when the potential extends away from the molecular surface and protrudes into the solvent. In contrast, geometric docking is recommended when the electrostatic potential around the molecules to be docked appears homogenous, that is, with a similar sign all around the molecule.