3D Molecular Similarity: Method and Algorithms

被引:2
作者
Ursu, Oleg [1 ]
Diudea, Mircea V. [1 ]
Nakayama, Shin-ichi [2 ]
机构
[1] Babes Bolyai Univ, Fac Chem & Chem Engn, 11 Arany Janos Str, Cluj Napoca 400028, Romania
[2] Univ Tsukuba, Res Ctr Knowledge Communities, Tsukuba, Ibaraki 3058550, Japan
关键词
Molecular similarity; Maximum common subgraph; Distance geometry; Similarity coefficient;
D O I
10.2477/jccj.5.39
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
This study presents a method and algorithms for calculation of 3D similarity between pairs of chemical structures represented as 3D molecular graphs. Similarity searching in chemical databases is widely used for virtual screening, lead discovery and optimization, and most recently protein amino-acid sequences studies to discover and determine the functionality of a new isolated protein. This method has obvious advantages over other known methods due to the following: (i) the superposition method does not depend on the preliminary alignments of the chemical structures; (ii) entire conformational space is searched without generation of each conformer; (iii) excellent discrimination between geometrical isomers. Although it is a computationally demanding method, recent implementation of maximum clique algorithm and bound smoothing algorithm made possible the optimization of this method and application to similarity searching in chemical databases of non trivial size.
引用
收藏
页码:39 / 46
页数:8
相关论文
共 8 条