Institut für Chemie, Humboldt-Universität zu Berlin, Unter den Linden 6, Berlin D-10099, Germany.
J Comput Chem. 2012 Jan 15;33(2):134-40. doi: 10.1002/jcc.21925. Epub 2011 Oct 14.
An algorithm for similarity recognition of molecules and molecular clusters is presented which also establishes the optimum matching among atoms of different structures. In the first step of the algorithm, a set of molecules are coarsely superimposed by transforming them into a common reference coordinate system. The optimum atomic matching among structures is then found with the help of the Hungarian algorithm. For this, pairs of structures are represented as complete bipartite graphs with a weight function that uses intermolecular atomic distances. In the final step, a rotational superposition method is applied using the optimum atomic matching found. This yields the minimum root mean square deviation of intermolecular atomic distances with respect to arbitrary rotation and translation of the molecules. Combined with an effective similarity prescreening method, our algorithm shows robustness and an effective quadratic scaling of computational time with the number of atoms.
本文提出了一种分子和分子簇相似性识别算法,该算法还可以在不同结构的原子之间建立最佳匹配。在算法的第一步中,通过将分子转换为公共参考坐标系来粗略地叠加一组分子。然后,借助匈牙利算法找到结构之间的最佳原子匹配。为此,将结构对表示为具有权重函数的完全二分图,该权重函数使用分子间原子距离。在最后一步,使用找到的最佳原子匹配应用旋转叠加方法。这使得分子任意旋转和平移的分子间原子距离的均方根偏差最小。与有效的相似性预筛选方法相结合,我们的算法表现出了鲁棒性,并且计算时间随原子数量呈有效二次缩放。