Kernel approach to molecular similarity based on iterative graph similarity.
Similarity measures for molecules are of basic importance in chemical, biological, and pharmaceutical applications. We introduce a molecular similarity measure defined directly on the annotated molecular graph, based on iterative graph similarity and optimal assignments. We give an iterative algorithm for the computation of the proposed molecular similarity measure, prove its convergence and the uniqueness of the solution, and provide an upper bound on the required number of iterations necessary to achieve a desired precision. Empirical evidence for the positive semidefiniteness of certain parametrizations of our function is presented. We evaluated our molecular similarity measure by using it as a kernel in support vector machine classification and regression applied to several pharmaceutical and toxicological data sets, with encouraging results.
Rupp
Matthias
M
Johann Wolfgang Goethe-University, Siesmayerstrasse 70, Frankfurt am Main, Germany. matthias.rupp@bio.uni-frankfurt.de
Proschak
Ewgenij
E
Schneider
Gisbert
G
D019295:Computational Biology; D008958:Models, Molecular; D004364:Pharmaceutical Preparations; D012984:Software
D004364:Pharmaceutical Preparations