{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:54:15Z","timestamp":1763808855928},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,10]],"date-time":"2009-08-10T00:00:00Z","timestamp":1249862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1186\/1758-2946-1-12","type":"journal-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T06:14:56Z","timestamp":1249971296000},"source":"Crossref","is-referenced-by-count":97,"title":["Small Molecule Subgraph Detector (SMSD) toolkit"],"prefix":"10.1186","volume":"1","author":[{"given":"Syed Asad","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Bashton","sequence":"additional","affiliation":[]},{"given":"Gemma L","family":"Holliday","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Schrader","sequence":"additional","affiliation":[]},{"given":"Janet M","family":"Thornton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,10]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/3527601643","volume-title":"Chemoinformatics: A Textbook","author":"J Gasteiger","year":"2003","unstructured":"Gasteiger J, Engel T: Chemoinformatics: A Textbook. 2003, WILEY-VCH GmbH & Co"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1021\/ci600444g","volume":"47","author":"EJ Gardiner","year":"2007","unstructured":"Gardiner EJ, Gillet VJ, Willett P, Cosgrove DA: Representing clusters using a maximum common edge substructure algorithm applied to reduced graphs and molecular graphs. Journal of chemical information and modeling. 2007, 47 (2): 354-366. 10.1021\/ci600444g.","journal-title":"Journal of chemical information and modeling"},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S1093-3263(02)00188-2","volume":"21","author":"JW Raymond","year":"2003","unstructured":"Raymond JW, Blankley CJ, Willett P: Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. J Mol Graph Model. 2003, 21 (5): 421-433. 10.1016\/S1093-3263(02)00188-2.","journal-title":"J Mol Graph Model"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1021\/ci000150t","volume":"41","author":"JH Voigt","year":"2001","unstructured":"Voigt JH, Bienfait B, Wang S, Nicklaus MC: Comparison of the NCI open database with seven large chemical structural databases. J Chem Inf Comput Sci. 2001, 41 (3): 702-712.","journal-title":"J Chem Inf Comput Sci"},{"issue":"20","key":"12_CR5","doi-asserted-by":"publisher","first-page":"e137","DOI":"10.1093\/nar\/gkn610","volume":"36","author":"Y Li","year":"2008","unstructured":"Li Y, Hao P, Zheng S, Tu K, Fan H, Zhu R, Ding G, Dong C, Wang C, Li X, et al: Gene expression module-based chemical function similarity search. Nucleic acids research. 2008, 36 (20): e137-10.1093\/nar\/gkn610.","journal-title":"Nucleic acids research"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1021\/ci700271z","volume":"47","author":"G Barreiro","year":"2007","unstructured":"Barreiro G, Guimaraes CR, Tubert-Brohman I, Lyons TM, Tirado-Rives J, Jorgensen WL: Search for non-nucleoside inhibitors of HIV-1 reverse transcriptase using chemical similarity, molecular docking, and MM-GB\/SA scoring. Journal of chemical information and modeling. 2007, 47 (6): 2416-2428. 10.1021\/ci700271z.","journal-title":"Journal of chemical information and modeling"},{"issue":"17","key":"12_CR7","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/S1359-6446(02)02411-X","volume":"7","author":"RP Sheridan","year":"2002","unstructured":"Sheridan RP, Kearsley SK: Why do we need so many chemical similarity search methods?. Drug Discov Today. 2002, 7 (17): 903-911. 10.1016\/S1359-6446(02)02411-X.","journal-title":"Drug Discov Today"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1021\/ci025592e","volume":"43","author":"VJ Gillet","year":"2003","unstructured":"Gillet VJ, Willett P, Bradshaw J: Similarity searching using reduced graphs. J Chem Inf Comput Sci. 2003, 43 (2): 338-345.","journal-title":"J Chem Inf Comput Sci"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0958-1669(99)00059-2","volume":"11","author":"P Willett","year":"2000","unstructured":"Willett P: Chemoinformatics \u2013 similarity and diversity in chemical libraries. Curr Opin Biotechnol. 2000, 11 (1): 85-88. 10.1016\/S0958-1669(99)00059-2.","journal-title":"Curr Opin Biotechnol"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1021\/ci020017w","volume":"42","author":"B Cuissart","year":"2002","unstructured":"Cuissart B, Touffet F, Cremilleux B, Bureau R, Rault S: The maximum common substructure as a molecular depiction in a supervised classification context: experiments in quantitative structure\/biodegradability relationships. J Chem Inf Comput Sci. 2002, 42 (5): 1043-1052.","journal-title":"J Chem Inf Comput Sci"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1021\/ci034167y","volume":"44","author":"G Cerruela Garc\u00eda","year":"2004","unstructured":"Cerruela Garc\u00eda G, Luque Ruiz I, G\u00f3mez-Nieto MA: Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm. Journal of Chemical Information and Computer Sciences. 2004, 44: 30-41.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"12_CR12","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS: Computers and Intractability; A Guide to the Theory of NP-Completeness. 1990, W. H. Freeman & Co"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J: Finding all the cliques in an undirected graph. Communication of the ACM. 1973, 16: 189-201. 10.1145\/362342.362367.","journal-title":"Communication of the ACM"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jmbi.1998.1689","volume":"279","author":"R Samudrala","year":"1998","unstructured":"Samudrala R, Moult J: A graph-theoretic algorithm for comparative modeling of protein structure. Journal of molecular biology. 1998, 279 (1): 287-302. 10.1006\/jmbi.1998.1689.","journal-title":"Journal of molecular biology"},{"issue":"39","key":"12_CR15","doi-asserted-by":"publisher","first-page":"11853","DOI":"10.1021\/ja036030u","volume":"125","author":"M Hattori","year":"2003","unstructured":"Hattori M, Okuno Y, Goto S, Kanehisa M: Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. Journal of the American Chemical Society. 2003, 125 (39): 11853-11865. 10.1021\/ja036030u.","journal-title":"Journal of the American Chemical Society"},{"issue":"2\u20133","key":"12_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1089\/1066527041410337","volume":"11","author":"T Akutsu","year":"2004","unstructured":"Akutsu T: Efficient extraction of mapping rules of atoms from enzymatic reaction data. J Comput Biol. 2004, 11 (2\u20133): 449-462. 10.1089\/1066527041410337.","journal-title":"J Comput Biol"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1021\/ci010381f","volume":"42","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Gardiner EJ, Willett P: Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J Chem Inf Comput Sci. 2002, 42 (2): 305-316.","journal-title":"J Chem Inf Comput Sci"},{"issue":"7","key":"12_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Willett P: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of computer-aided molecular design. 2002, 16 (7): 521-533. 10.1023\/A:1021271615909.","journal-title":"Journal of computer-aided molecular design"},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0898-5529(90)90061-C","volume":"3","author":"C Tonnelier","year":"1990","unstructured":"Tonnelier C, Jauffret P, Hanser T, Kaufmann G: Machine learning of generic reactions: 3. an efficient algorithm for maximal common substructure determination. Tetrahedron Computer Methodology. 1990, 3 (6): 351-358. 10.1016\/0898-5529(90)90061-C.","journal-title":"Tetrahedron Computer Methodology"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor JJ: Backtrack search algorithms and the maximal common sub-graph problem. Software Practice and Exprerience. 1982, 12: 23-24. 10.1002\/spe.4380120103.","journal-title":"Software Practice and Exprerience"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1021\/ci00031a005","volume":"21","author":"JJ McGregor","year":"1981","unstructured":"McGregor JJ, Willet P: Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions. J Chem Inf Comput Sci. 1981, 21: 137-140. [\n                    http:\/\/pubs.acs.org\/doi\/abs\/10.1021\/ci00031a005\n                    \n                  ]","journal-title":"J Chem Inf Comput Sci"},{"issue":"13","key":"12_CR22","doi-asserted-by":"publisher","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao Y, Jiang T, Girke T: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics (Oxford, England). 2008, 24 (13): i366-374. 10.1093\/bioinformatics\/btn186.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"12_CR23","first-page":"8","volume-title":"An Improved Algorithm for Matching Large Graphs","author":"LP Cordella","year":"2008","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M: An Improved Algorithm for Matching Large Graphs. 2008, 8-[\n                    http:\/\/amalfi.dis.unina.it\/graph\/db\/papers\/vf-algorithm.pdf\n                    \n                  ]"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M: A (sub)graph isomorphism algorithm for matching large graphs. IEEE T Pattern Anal. 2004, 26: 1367-1372. 10.1109\/TPAMI.2004.75.","journal-title":"IEEE T Pattern Anal"},{"key":"12_CR25","first-page":"197","volume-title":"Proc. 1983 Int. Conf. Syst., Man, and Cybern","author":"AKC Wong","year":"1983","unstructured":"Wong AKC, Akinniyi FA: An algorithm for the largest common subgraph isomorphism using the implicit net. Proc. 1983 Int. Conf. Syst., Man, and Cybern. 1983, 197-201."},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR: An Algorithm for Subgraph Isomorphism. J ACM. 1976, 23 (1): 31-42. 10.1145\/321921.321925.","journal-title":"J ACM"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Kanehisa M, Goto S, Hattori M, Aoki-Kinoshita KF, Itoh M, Kawashima S, Katayama T, Araki M, Hirakawa M: From genomics to chemical genomics: new developments in KEGG. Nucleic acids research. 2006, D354-357. 10.1093\/nar\/gkj102. 34 Database","DOI":"10.1093\/nar\/gkj102"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"D301","DOI":"10.1093\/nar\/gkl971","volume":"35","author":"H Berman","year":"2007","unstructured":"Berman H, Henrick K, Nakamura H, Markley JL: The worldwide Protein Data Bank (wwPDB): ensuring a single, uniform archive of PDB data. Nucleic acids research. 2007, 35: D301-303. 10.1093\/nar\/gkl971.","journal-title":"Nucleic acids research"},{"issue":"17","key":"12_CR29","doi-asserted-by":"publisher","first-page":"2111","DOI":"10.2174\/138161206777585274","volume":"12","author":"C Steinbeck","year":"2006","unstructured":"Steinbeck C, Hoppe C, Kuhn S, Floris M, Guha R, Willighagen EL: Recent developments of the chemistry development kit (CDK) \u2013 an open-source java library for chemo- and bioinformatics. Curr Pharm Des. 2006, 12 (17): 2111-2120. 10.2174\/138161206777585274.","journal-title":"Curr Pharm Des"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1021\/ci025584y","volume":"43","author":"C Steinbeck","year":"2003","unstructured":"Steinbeck C, Han Y, Kuhn S, Horlacher O, Luttmann E, Willighagen E: The Chemistry Development Kit (CDK): an open-source Java library for Chemo- and Bioinformatics. J Chem Inf Comput Sci. 2003, 43 (2): 493-500.","journal-title":"J Chem Inf Comput Sci"},{"issue":"1\u20132","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch I: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science. 2001, 250 (1\u20132): 1-30. 10.1016\/S0304-3975(00)00286-3.","journal-title":"Theoretical Computer Science"},{"key":"12_CR32","volume-title":"Kodierung enzymatischer Reaktionen","author":"M Leber","year":"2008","unstructured":"Leber M: Kodierung enzymatischer Reaktionen. 2008, University of Cologne"},{"issue":"1\u20133","key":"12_CR33","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals F, Karande C: A note on the problem of reporting maximal cliques. Theoretical Computer Science. 2008, 407 (1\u20133): 564-568. 10.1016\/j.tcs.2008.05.010.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR34","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.tcs.2005.09.038","volume":"349","author":"F Cazals","year":"2005","unstructured":"Cazals F, Karande C: An algorithm for reporting maximal c-cliques. Theoretical Computer Science. 2005, 349 (3): 484-490. 10.1016\/j.tcs.2005.09.038.","journal-title":"Theoretical Computer Science"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Kanehisa M, Araki M, Goto S, Hattori M, Hirakawa M, Itoh M, Katayama T, Kawashima S, Okuda S, Tokimatsu T, et al: KEGG for linking genomes to life and the environment. Nucleic acids research. 2008, D480-484. 36 Database","DOI":"10.1093\/nar\/gkm882"},{"issue":"3","key":"12_CR36","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1021\/ci034001x","volume":"43","author":"JD Holliday","year":"2003","unstructured":"Holliday JD, Salim N, Whittle M, Willett P: Analysis and display of the size dependence of chemical similarity coefficients. J Chem Inf Comput Sci. 2003, 43 (3): 819-828.","journal-title":"J Chem Inf Comput Sci"},{"issue":"2","key":"12_CR37","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1021\/ci800292d","volume":"49","author":"J Chen","year":"2009","unstructured":"Chen J, Holliday J, Bradshaw J: A machine learning approach to weighting schemes in the data fusion of similarity coefficients. Journal of chemical information and modeling. 2009, 49 (2): 185-194. 10.1021\/ci800292d.","journal-title":"Journal of chemical information and modeling"},{"issue":"1","key":"12_CR38","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1021\/ci990316u","volume":"40","author":"JW Godden","year":"2000","unstructured":"Godden JW, Xue L, Bajorath J: Combinatorial preferences affect molecular similarity\/diversity calculations using binary fingerprints and Tanimoto coefficients. J Chem Inf Comput Sci. 2000, 40 (1): 163-166.","journal-title":"J Chem Inf Comput Sci"},{"issue":"1","key":"12_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1016387816342","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Willett P: Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. Journal of computer-aided molecular design. 2002, 16 (1): 59-71. 10.1023\/A:1016387816342.","journal-title":"Journal of computer-aided molecular design"},{"issue":"11","key":"12_CR40","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1101\/gr.1212003","volume":"13","author":"M Arita","year":"2003","unstructured":"Arita M: In silico atomic tracing by substrate-product relationships in Escherichia coli intermediary metabolism. Genome Res. 2003, 13 (11): 2455-2466. 10.1101\/gr.1212003.","journal-title":"Genome Res"},{"issue":"6","key":"12_CR41","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1073\/pnas.0306458101","volume":"101","author":"M Arita","year":"2004","unstructured":"Arita M: The metabolic world of Escherichia coli is not small. Proceedings of the National Academy of Sciences of the United States of America. 2004, 101 (6): 1543-1547. 10.1073\/pnas.0306458101.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"1","key":"12_CR42","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tibtech.2004.12.001","volume":"23","author":"C Birkemeyer","year":"2005","unstructured":"Birkemeyer C, Luedemann A, Wagner C, Erban A, Kopka J: Metabolome analysis: the potential of in vivo labeling with stable isotopes for metabolite profiling. Trends in biotechnology. 2005, 23 (1): 28-33. 10.1016\/j.tibtech.2004.12.001.","journal-title":"Trends in biotechnology"},{"issue":"23","key":"12_CR43","doi-asserted-by":"publisher","first-page":"3193","DOI":"10.1093\/bioinformatics\/btm498","volume":"23","author":"F Mu","year":"2007","unstructured":"Mu F, Williams RF, Unkefer CJ, Unkefer PJ, Faeder JR, Hlavacek WS: Carbon-fate maps for metabolic reactions. Bioinformatics (Oxford, England). 2007, 23 (23): 3193-3199. 10.1093\/bioinformatics\/btm498.","journal-title":"Bioinformatics (Oxford, England)"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1758-2946-1-12.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1758-2946-1-12\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1758-2946-1-12.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T14:08:46Z","timestamp":1561385326000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/1758-2946-1-12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,10]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1186\/1758-2946-1-12","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,10]]},"article-number":"12"}}