Jain A N
Arris Pharmaceutical Corporation, San Francisco, CA 94080, USA.
J Comput Aided Mol Des. 1996 Oct;10(5):427-40. doi: 10.1007/BF00124474.
Exploitation of protein structures for potential drug leads by molecular docking is critically dependent on methods for scoring putative protein-ligand interactions. An ideal function for scoring must exhibit predictive accuracy and high computational speed, and must be tolerant of variations in the relative protein-ligand molecular alignment and conformation. This paper describes the development of an empirically derived scoring function, based on the binding affinities of protein-ligand complexes coupled with their crystallographically determined structures. The function's primary terms involve hydrophobic and polar complementarity, with additional terms for entropic and solvation effects. The issue of alignment/conformation dependence was solved by constructing a continuous differentiable nonlinear function with the requirement that maxima in ligand conformation/alignment space corresponded closely to crystallographically determined structures. The expected error in the predicted affinity based on cross-validation was 1.0 log unit. The function is sufficiently fast and accurate to serve as the objective function of a molecular-docking search engine. The function is particularly well suited to the docking problem, since it has spatially narrow maxima that are broadly accessible via gradient descent.
通过分子对接利用蛋白质结构寻找潜在药物先导物,关键取决于对假定的蛋白质-配体相互作用进行评分的方法。理想的评分函数必须具备预测准确性和高计算速度,并且必须能够容忍蛋白质-配体相对分子排列和构象的变化。本文描述了一种基于蛋白质-配体复合物结合亲和力及其晶体学确定结构推导出来的经验评分函数的开发。该函数的主要项涉及疏水和极性互补,还有熵和溶剂化效应的附加项。通过构建一个连续可微的非线性函数解决了排列/构象依赖性问题,要求配体构象/排列空间中的最大值与晶体学确定的结构紧密对应。基于交叉验证预测亲和力的预期误差为1.0对数单位。该函数速度足够快且准确,可作为分子对接搜索引擎的目标函数。该函数特别适合对接问题,因为它具有空间上狭窄的最大值,可通过梯度下降广泛获取。