Similarity searching in files of three-dimensional chemical structures: Representation and searching of molecular electrostatic potentials using field-graphs

被引:36
作者
Thorner, DA
Willett, P
Wright, PM
Taylor, R
机构
[1] UNIV SHEFFIELD,KREBS INST BIOMOLEC RES,SHEFFIELD S10 2TN,S YORKSHIRE,ENGLAND
[2] UNIV SHEFFIELD,DEPT INFORMAT STUDIES,SHEFFIELD S10 2TN,S YORKSHIRE,ENGLAND
[3] ZENECA AGROCHEM,JEALOTTS HILL RES STN,BRACKNELL RG12 6EY,BERKS,ENGLAND
基金
英国工程与自然科学研究理事会;
关键词
clique-detection algorithm; database searching; field-graph; molecular electrostatic potential; similarity searching;
D O I
10.1023/A:1008034527445
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
This paper reports a method for the identification of those molecules in a database of rigid 3D structures with molecular electrostatic potential (MEP) grids that are most similar to that of a user-defined target molecule. The most important features of an MEP grid are encoded infield-graphs, and a target molecule is matched against a database molecule by a comparison of the corresponding field-graphs. The matching is effected using a maximal common subgraph isomorphism algorithm, which provides an alignment of the target molecule's field-graph with those of each of the database molecules in turn. These alignments are used in the second stage of the search algorithm to calculate the intermolecular MEP similarities. Several different ways of generating field-graphs are evaluated, in terms of the effectiveness of the resulting similarity measures and of the associated computational costs. The most appropriate procedure has been implemented in an operational system that searches a corporate database, containing ca. 173 000 3D structures.
引用
收藏
页码:163 / 174
页数:12
相关论文
共 42 条
[1]  
ASH JE, 1991, CHEM STRUCTURE SYSTE
[2]  
BRINT A T, 1988, Journal of Computer-Aided Molecular Design, V2, P311
[3]   ALGORITHMS FOR THE IDENTIFICATION OF 3-DIMENSIONAL MAXIMAL COMMON SUBSTRUCTURES [J].
BRINT, AT ;
WILLETT, P .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1987, 27 (04) :152-158
[4]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[5]   THE DISCOVERY OF NOVEL AUXIN TRANSPORT INHIBITORS BY MOLECULAR MODELING AND 3-DIMENSIONAL PATTERN-ANALYSIS [J].
BURES, MG ;
BLACKSCHAEFER, C ;
GARDNER, G .
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1991, 5 (04) :323-334
[6]   SEARCHING TECHNIQUES FOR DATABASES OF 3-DIMENSIONAL CHEMICAL STRUCTURES [J].
BURES, MG ;
MARTIN, YC ;
WILLETT, P .
TOPICS IN STEREOCHEMISTRY, VOL 21, 1994, 21 :467-511
[7]  
BURES MG, 1990, TETRAHEDRON COMP MET, V3, P673
[8]   THE APPLICATION OF MOLECULAR SIMILARITY CALCULATIONS [J].
BURT, C ;
RICHARDS, WG ;
HUXLEY, P .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 1990, 11 (10) :1139-1146
[9]   HOW SIMILAR IS A MOLECULE TO ANOTHER - AN ELECTRON-DENSITY MEASURE OF SIMILARITY BETWEEN 2 MOLECULAR-STRUCTURES [J].
CARBO, R ;
LEYDA, L ;
ARNAU, M .
INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1980, 17 (06) :1185-1189
[10]   PHARMACOPHORIC PATTERN-MATCHING IN FILES OF 3-DIMENSIONAL CHEMICAL STRUCTURES - USE OF BOUNDED DISTANCE MATRICES FOR THE REPRESENTATION AND SEARCHING OF CONFORMATIONALLY FLEXIBLE MOLECULES [J].
CLARK, DE ;
WILLETT, P ;
KENNY, PW .
JOURNAL OF MOLECULAR GRAPHICS & MODELLING, 1992, 10 (04) :194-204