Perkins T D, Dean P M
Department of Pharmacology, University of Cambridge, U.K.
J Comput Aided Mol Des. 1993 Apr;7(2):155-72. doi: 10.1007/BF00126442.
This paper describes a computational strategy for the superposition of a set of flexible molecules. The combinatorial problems of searching conformational space and molecular matching are reduced drastically by the combined use of simulated annealing methods and cluster analysis. For each molecule, the global minimum of the conformational energy is determined by annealing and the search trajectory is retained in a history file. All the significantly different low-energy conformations are extracted by cluster analysis of data in the history file. Each pair of molecules, in each of their significantly different conformations, is then matched by simulated annealing, using the difference-distance matrix as the objective function. A set of match statistics is then obtained, from which the best match taken from all different conformations can be found. The molecules are then superposed either by reference to a base molecule or by a consensus method. This strategy ensures that as wide a range of conformations as possible is considered, but at the same time that the smallest number of significantly different conformations is used. The method has been tested on a set of six angiotensin II antagonists with between 7-11 rotatable bonds.
本文描述了一种用于一组柔性分子叠加的计算策略。通过结合使用模拟退火方法和聚类分析,大幅减少了搜索构象空间和分子匹配的组合问题。对于每个分子,通过退火确定构象能量的全局最小值,并将搜索轨迹保存在历史文件中。通过对历史文件中的数据进行聚类分析,提取所有显著不同的低能量构象。然后,对于每对分子的每个显著不同构象,使用差异距离矩阵作为目标函数,通过模拟退火进行匹配。接着获得一组匹配统计数据,从中可以找到所有不同构象中的最佳匹配。然后通过参考基础分子或通过共识方法对分子进行叠加。该策略确保考虑尽可能广泛的构象范围,但同时使用最少数量的显著不同构象。该方法已在一组具有7至11个可旋转键的六种血管紧张素II拮抗剂上进行了测试。