title: Kernel approach to molecular similarity based on iterative graph similarity.
abstract: 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.
authors.affiliation: Johann Wolfgang Goethe-University, Siesmayerstrasse 70, Frankfurt am Main, Germany. matthias.rupp@bio.uni-frankfurt.de
authors.forename: Matthias
authors.initials: M
authors.lastname: Rupp
authors.forename: Ewgenij
authors.initials: E
authors.lastname: Proschak
authors.forename: Gisbert
authors.initials: G
authors.lastname: Schneider
mesh_terms: D019295:Computational Biology; D008958:Models, Molecular; D004364:Pharmaceutical Preparations; D012984:Software
chemical_list: D004364:Pharmaceutical Preparations