- Oral presentation
- Open Access
Efficient maximum common subgraph (MCS) searching of large chemical databases
© Sayle et al.; licensee BioMed Central Ltd. 2013
Published: 22 March 2013
- Wipke WT, Rogers D: Rapid Subgraph Search using Parallelism. J Chem Inf Comput Sci. 1984, 24: 255-262. 10.1021/ci00044a012.View ArticleGoogle Scholar
- Messmer BT, Bunke H: Subgraph Isomorphism Detection in Polynomial Time on Preprocessed Graphs. Proc Asian Conf on Computer Vision. 1995, 151-155.Google Scholar
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.