Small Molecule Subgraph Detector (SMSD) toolkit

Journal of Cheminformatics

Volumn 1, Issue 1, 2009, Pages

  Rahman, Syed Asad ^a   Bashton, Matthew ^a   Holliday, Gemma L ^a   Schrader, Rainer ^b   Thornton, Janet M ^a  

^a WELLCOME TRUST SANGER INSTITUTE   (United Kingdom)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 74049089230     PISSN: None     EISSN: 17582946     Source Type: Journal    
DOI: 10.1186/1758-2946-1-12     Document Type: Article

References (43)

1. Chemoinformatics: A Textbook. J Gasteiger T Engel, WILEY-VCH GmbH & Co 2003
2. Representing clusters using a maximum common edge substructure algorithm applied to reduced graphs and molecular graphs. EJ Gardiner VJ Gillet P Willett DA Cosgrove, Journal of chemical information and modeling 2007 47 2 354 366 10.1021/ci600444g 17309248
3. Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. JW Raymond CJ Blankley P Willett, J Mol Graph Model 2003 21 5 421 433 10.1016/S1093-3263(02)00188-2 12543138
4. Comparison of the NCI open database with seven large chemical structural databases. JH Voigt B Bienfait S Wang MC Nicklaus, J Chem Inf Comput Sci 2001 41 3 702 712 11410049
5. Gene expression module-based chemical function similarity search. Y Li P Hao S Zheng K Tu H Fan R Zhu G Ding C Dong C Wang X Li, et al. Nucleic acids research 2008 36 20 137 10.1093/nar/gkn610 18842630
6. Search for non-nucleoside inhibitors of HIV-1 reverse transcriptase using chemical similarity, molecular docking, and MM-GB/SA scoring. G Barreiro CR Guimaraes I Tubert-Brohman TM Lyons J Tirado-Rives WL Jorgensen, Journal of chemical information and modeling 2007 47 6 2416 2428 10.1021/ci700271z 17949071
7. Why do we need so many chemical similarity search methods? RP Sheridan SK Kearsley, Drug Discov Today 2002 7 17 903 911 10.1016/S1359-6446(02)02411-X 12546933
8. Similarity searching using reduced graphs. VJ Gillet P Willett J Bradshaw, J Chem Inf Comput Sci 2003 43 2 338 345 12653495
9. Chemoinformatics - similarity and diversity in chemical libraries. P Willett, Curr Opin Biotechnol 2000 11 1 85 88 10.1016/S0958-1669(99)00059-2 10679335
10. The maximum common substructure as a molecular depiction in a supervised classification context: experiments in quantitative structure/biodegradability relationships. B Cuissart F Touffet B Cremilleux R Bureau S Rault, J Chem Inf Comput Sci 2002 42 5 1043 1052 12376991
11. Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm. G Cerruela García I Luque Ruiz MA Gámez-Nieto, Journal of Chemical Information and Computer Sciences 2004 44 30 41 14741008
12. Computers and Intractability; A Guide to the Theory of NP-Completeness. MR Garey DS Johnson, W. H. Freeman & Co 1990
13. Finding all the cliques in an undirected graph. C Bron J Kerbosch, Communication of the ACM 1973 16 189 201 10.1145/362342.362367
14. A graph-theoretic algorithm for comparative modeling of protein structure. R Samudrala J Moult, Journal of molecular biology 1998 279 1 287 302 10.1006/jmbi.1998.1689 9636717
15. Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. M Hattori Y Okuno S Goto M Kanehisa, Journal of the American Chemical Society 2003 125 39 11853 11865 10.1021/ja036030u 14505407
16. Efficient extraction of mapping rules of atoms from enzymatic reaction data. T Akutsu, J Comput Biol 2004 11 2-3 449 462 10.1089/1066527041410337 15285901
17. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. JW Raymond EJ Gardiner P Willett, J Chem Inf Comput Sci 2002 42 2 305 316 11911700
18. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. JW Raymond P Willett, Journal of computer-aided molecular design 2002 16 7 521 533 10.1023/A:1021271615909 12510884 (Pubitemid 36013605)
19. Machine learning of generic reactions: 3. an efficient algorithm for maximal common substructure determination. C Tonnelier P Jauffret T Hanser G Kaufmann, Tetrahedron Computer Methodology 1990 3 6 351 358 10.1016/0898-5529(90)90061-C
20. Backtrack search algorithms and the maximal common sub-graph problem. JJ McGregor, Software Practice and Exprerience 1982 12 23 24 10.1002/spe.4380120103
21. Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions. JJ McGregor P Willet, J Chem Inf Comput Sci 1981 21 137 140 http://pubs.acs.org/doi/abs/10.1021/ci00031a005
22. A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Y Cao T Jiang T Girke, Bioinformatics (Oxford, England) 2008 24 13 366 374 10.1093/bioinformatics/btn186 18586736
23. An Improved Algorithm for Matching Large Graphs. LP Cordella P Foggia C Sansone M Vento, 2008 8 http://amalfi.dis.unina.it/graph/db/papers/vf-algorithm.pdf
24. A (sub)graph isomorphism algorithm for matching large graphs. LP Cordella P Foggia C Sansone M Vento, IEEE T Pattern Anal 2004 26 1367 1372 10.1109/TPAMI.2004.75
25. An algorithm for the largest common subgraph isomorphism using the implicit net. AKC Wong FA Akinniyi, Proc. 1983 Int. Conf. Syst., Man, and Cybern 1983 197 201
26. An Algorithm for Subgraph Isomorphism. JR Ullmann, J ACM 1976 23 1 31 42 10.1145/321921.321925
27. From genomics to chemical genomics: new developments in KEGG. M Kanehisa S Goto M Hattori KF Aoki-Kinoshita M Itoh S Kawashima T Katayama M Araki M Hirakawa, Nucleic acids research 2006 34 Database 354 357 16381885 10.1093/nar/gkj102
28. The worldwide Protein Data Bank (wwPDB): ensuring a single, uniform archive of PDB data. H Berman K Henrick H Nakamura JL Markley, Nucleic acids research 2007 35 301 303 17142228 10.1093/nar/gkl971 (Pubitemid 46056219)
29. Recent developments of the chemistry development kit (CDK) - an open-source java library for chemo- and bioinformatics. C Steinbeck C Hoppe S Kuhn M Floris R Guha EL Willighagen, Curr Pharm Des 2006 12 17 2111 2120 10.2174/138161206777585274 16796559
30. The Chemistry Development Kit (CDK): an open-source Java library for Chemo- and Bioinformatics. C Steinbeck Y Han S Kuhn O Horlacher E Luttmann E Willighagen, J Chem Inf Comput Sci 2003 43 2 493 500 12653513
31. Enumerating all connected maximal common subgraphs in two graphs. I Koch, Theoretical Computer Science 2001 250 1-2 1 30 10.1016/S0304-3975(00)00286-3
32. Kodierung enzymatischer Reaktionen. M Leber, University of Cologne 2008
33. A note on the problem of reporting maximal cliques. F Cazals C Karande, Theoretical Computer Science 2008 407 1-3 564 568 10.1016/j.tcs.2008.05.010
34. An algorithm for reporting maximal c-cliques. F Cazals C Karande, Theoretical Computer Science 2005 349 3 484 490 10.1016/j.tcs.2005.09.038
35. KEGG for linking genomes to life and the environment. M Kanehisa M Araki S Goto M Hattori M Hirakawa M Itoh T Katayama S Kawashima S Okuda T Tokimatsu, et al. Nucleic acids research 2008 36 Database 480 484 18077471
36. Analysis and display of the size dependence of chemical similarity coefficients. JD Holliday N Salim M Whittle P Willett, J Chem Inf Comput Sci 2003 43 3 819 828 12767139
37. A machine learning approach to weighting schemes in the data fusion of similarity coefficients. J Chen J Holliday J Bradshaw, Journal of chemical information and modeling 2009 49 2 185 194 10.1021/ci800292d 19434822
38. Combinatorial preferences affect molecular similarity/diversity calculations using binary fingerprints and Tanimoto coefficients. JW Godden L Xue J Bajorath, J Chem Inf Comput Sci 2000 40 1 163 166 10661563
39. Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. JW Raymond P Willett, Journal of computer-aided molecular design 2002 16 1 59 71 10.1023/A:1016387816342 12197666
40. In silico atomic tracing by substrate-product relationships in Escherichia coli intermediary metabolism. M Arita, Genome Res 2003 13 11 2455 2466 14559781 10.1101/gr.1212003 (Pubitemid 37428270)
41. The metabolic world of Escherichia coli is not small. M Arita, Proceedings of the National Academy of Sciences of the United States of America 2004 101 6 1543 1547 14757824 10.1073/pnas.0306458101 (Pubitemid 38234191)
42. Metabolome analysis: the potential of in vivo labeling with stable isotopes for metabolite profiling. C Birkemeyer A Luedemann C Wagner A Erban J Kopka, Trends in biotechnology 2005 23 1 28 33 10.1016/j.tibtech.2004.12.001 15629855
43. Carbon-fate maps for metabolic reactions. F Mu RF Williams CJ Unkefer PJ Unkefer JR Faeder WS Hlavacek, Bioinformatics (Oxford, England) 2007 23 23 3193 3199 10.1093/bioinformatics/btm498 17933853