Published in

American Chemical Society, Journal of Chemical Information and Modeling, 6(47), p. 2280-2286, 2007

DOI: 10.1021/ci700274r

Links

Tools

Export citation

Search in Google Scholar

Kernel Approach to Molecular Similarity Based on Iterative Graph Similarity

Journal article published in 2007 by Matthias Rupp ORCID, Ewgenij Proschak, Gisbert Schneider ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
  • Must obtain written permission from Editor
  • Must not violate ACS ethical Guidelines
Orange circle
Postprint: archiving restricted
  • Must obtain written permission from Editor
  • Must not violate ACS ethical Guidelines
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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.