Volume 5 Supplement 1

8th German Conference on Chemoinformatics: 26 CIC-Workshop

Open Access

Efficient maximum common subgraph (MCS) searching of large chemical databases

Journal of Cheminformatics20135(Suppl 1):O15

DOI: 10.1186/1758-2946-5-S1-O15

Published: 22 March 2013

Despite dramatic improvements in the hardware resources and computational power available to pharmaceutical researchers over the past few decades, the methods used for assessing the 2D chemical similarity between two molecules hasn't changed much since the 1960s. Here we report a novel chemical database search method that allows the exact size of the maximum common edge subgraph (MCES) between a query molecule and molecules in a database to be calculated rapidly. Using a pre-computed index, the 50 nearest neighbors of a query can be determined in a few seconds, even for databases containing millions of compounds. This work builds upon the previous efforts of Wipke and Rogers in the 1980s [1] and of Messmer and Bunke in the 1990s [2], harnessing the advances in high-performance computing and storage technology now available. A graphical depiction of such a "SmallWorld" index is shown below.

Authors’ Affiliations

NextMove Software Limited
Discovery Sciences, AstraZeneca R&D, Alderley Park


  1. Wipke WT, Rogers D: Rapid Subgraph Search using Parallelism. J Chem Inf Comput Sci. 1984, 24: 255-262. 10.1021/ci00044a012.View ArticleGoogle Scholar
  2. Messmer BT, Bunke H: Subgraph Isomorphism Detection in Polynomial Time on Preprocessed Graphs. Proc Asian Conf on Computer Vision. 1995, 151-155.Google Scholar


© Sayle et al.; licensee BioMed Central Ltd. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.