Irwin, JJ,Shoichet, BK.ZINC—a free database of commercially available compounds for virtual screening.J Chem Inf Model2005,45:177–182.

Geer, LY,Marchler‐Bauer, A,Geer, RC,Han, L,He, J,He, S,Liu, C,Shi, W,Bryant, SH.The NCBI Biosystems database.Nucleic Acids Res2009,38:492–496.

Xue, L,Godden, JW,Bajorath, J.Evaluation of descriptors and mini‐fingerprints for the identification of molecules with similar activity.J Cheml Inf Comput Sci2000,40:1227–1234.

Daylight Theory Manual. Daylight Chemical Information Systems Inc.

Durant, JL,Leland, BA,Henry, DR,Nourse, JG.Reoptimization of MDL keys for use in drug discovery.J Chem Inf Comput Sci2002,42:1273–1280.

Takahashi, Y,Sukekawa, M,Sasaki, S.Automatic identification of molecular similarity using reduced‐graph representation of chemical structure.J Chem Inf Comput Sci1992,32:639–643.

Rarey, M,Dixon, JS.Feature trees: a new molecular similarity measure based on tree matching.J Comput‐Aided Mol Des1998,12:471–490.

Harper, G,Bravi, GS,Pickett, SD,Hussain, J,Green, DVS.The reduced graph descriptor in virtual screening and data‐driven clustering of high‐throughput screening data.J Chem Inf Comput Sci2004,44:2145–2156.

Trinajstic, N.Chemical Graph Theory.2nd ed.New Directions in Civil Engineering. CRC Press;1992.

Gund, P.Three‐dimensional pharmacophoric pattern searching.Prog Mol Subcell Biol1977,5:117–143.

Gund, P.Pharmacophoric pattern searching and receptor mapping.Ann Rep Med Chem1979,14:299–308.

Whitney, H.Congruent graphs and the connectivity of graphs.Am J Math1932,54:150–168.

Raymond, JW,Willett, P.Maximum common subgraph isomorphism algorithms for the matching of chemical structures.J Comput‐Aided Mol Des2002,16:521–533.

Garey, MR.Computers and Intractability.New York: W. H. Freeman and Company;1979.

Bunke, H.Graph Matching: theoretical foundations, algorithms, and applications In:International Conference on Vision Interface.Quebec, Canada: Montreal;2000,82–88.

Pelillo, M,Siddiqi, K,Zucker, SW.Matching hierarchical structures using association graphs.IEEE Trans Pattern Anal Machine Intell1999,21:1105–1120.

Yang, B,Snyder, WE,Bilbro, GL.Matching oversegmented 3D images to models using association graphs.Image Vis Comput1989,7:135–143.

Barrow, HG,Burstall, RM.Subgraph isomorphism, matching relational structures and maximal cliques.Inf Process Lett1976,4:83–84.

Brint, A,Willett, P.Algorithms for the identification of 3‐dimensional maximal common substructures.J Chem Inf Comput Sci1987,27:152–158.

Levi, G.A note on the derivation of maximal common subgraphs of two directed or undirected graphs.Calcolo1973,9:341–352.

Cone, M,Venkataraghavan, R,McLafferty, F.Molecular structure comparison program for the identification of maximal common substructures.J Am Chem Soc1977,99:7668–7671.

Kuhl, F,Crippen, G,Friesen, D.A combinatorial algorithm for calculating ligand‐binding.J Comput Chem1984,5:24–34.

Bron, C,Kerbosch, J.Finding all cliques of an undirected graph.Commun of the ACM1973,16:575–577.

Balas, E,Yu, CS.Finding a maximum clique in an arbitrary graph.SIAM J Comput1986,15:1054–1068.

Carraghan, R,Pardalos, P.An exact algorithm for the maximum clique problem.Oper Res Lett1990,9:375–382.

Shindo, M,Tomita, E.A simple algorithm for finding a maximum clique and its worst‐case time complexity.Syst Comput Japan1990,21:1–13.

Babel, L.Finding maximum cliques in arbitrary and in special graphs.Computing1991,46:321–341.

Gardiner, EJ,Artymiuk, PJ,Willett, P.Clique‐detection algorithms for matching three‐dimensional molecular structures.J Mol Graph Model1997,15:245–253.

Raymond, JW,Gardiner, EJ,Willett, P.RASCAL: calculation of graph similarity using maximum common edge subgraphs.The Computer Journal2002,45:631–644.

Raymond, JW,Gardiner, EJ,Willett, P.Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm.J Chem Inf Comput Sc2002,42:305–316.

Barker, EJ,Buttar, D,Cosgrove, DA,Gardiner, EJ,Kitts, P,Willett, P,Gillet, VJ.Scaffold hopping using clique detection applied to reduced graphs.J Chem Inf Model2006,46:503–511.

Chao, S‐Y.Maximum common substructure extraction in RNA secondary structures using clique detection approach.World Acad Sci, Eng Technol2008,45:219–228.

Caboche, S,Pupin, M,Leclere, V,Jacques, P,Kucherov, G.Structural pattern matching of nonribosomal peptides.BMC Struct Biol2009,9:15.

Mehlhorn, K.Data structures and algorithms 2: graph algorithms and NP‐completeness. In:Monographs in Theoretical Computer Science. An EATCS Series.Vol. 2.Springer; London, UK1984.

Stahl, M,Mauser, H,Tsui, M,Taylor, NR.A robust clustering method for chemical structures.J Med Chem2005,48:4358–4366.

Jauffret, P,Tonnelier, C,Hanser, T,Kaufmann, G.Machine learning of generic reactions: 2. toward an advanced computer representation of chemical reactions.Tetrahedron Comput Methodol1990,3:335–349.

Koch, I.Enumerating all connected maximal common subgraphs in two graphs.Theor Comput Sci2001,250:1–30.

McGregor, JJ.Backtrack search algorithms and the maximal common subgraph problem.Softw: Pract Exp1982,12:23–34.

Ullmann, JR.An algorithm for subgraph isomorphism.J Assoc Comput Machinery1976,23:31–42.

Wong, AKC,Akinniyi, FA.An algorithm for the largest common subgraph isomorphism using the implicit net.Proc IEEE Syst, Man, and Cybern1983,1:197–201.

Barnard, J.Substructure searching methods — old and new.Journal of Chem Inf Comput Sci1993,33:532–538.

Cao, Y,Jiang, T,Girke, T.A maximum common substructure‐based algorithm for searching and predicting drug‐like compounds.Bioinformatics2008,24:366–374.

Berlo, RJPv,Groot, MJLd,Reinders, MJT,Ridder, Dd.Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. In: *Information %26 Communication Theory Group, Technical Report.Delft, the Netherlands: Delft University of Technology*;2009.

Cormen, TH,Leiserson, CE,Rivest, RL,Stein, C.Introduction to Algorithms. Cambridge,MA: MIT Press;2001.

Gupta, A,Nishimura, N.Finding largest subtrees and smallest supertrees.Algorithmica1998,21:183–210.

Schietgat, L,Ramon, J,Bruynooghe, M,Blockeel, H.An efficiently computable graph‐based metric for the classification of small molecules. In:Proceedings of the 11th International Conference on Discovery Science.Berlin, Heidelberg: Springer‐Verlag;2008,197–209.

Horvarth, T,Ramon, J,Wrobel, S.Frequent subgraph mining in outerplanar graphs. In:KDD `06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining.New York, NY: ACM;2006,197–206.

Hassan, M,Brown, RD,Varma‐O`brien, S,Rogers, D.Cheminformatics analysis and learning in a data pipelining environment.Mol Divers2006,10:283–299.

SciTegic.Pipeline Pilot — Basic Chemistry Collection User Guide.Telesis Court, San Diego, CA;2006,92121–4779.

Morgan, HL.The generation of a unique machine description for chemical structures—a technique developed at chemical abstracts service.J Chem Doc1965,5:107–113.

Conte, D,Guidobaldi, C,Sansone, C.A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In:Graph Based Representations In Pattern Recognition.Berlin: Springer‐Verlag;2003,130–141.

Durand, PJ,Pasari, R,Baker, JW,Tsai, C‐C.An efficient algorithm for similarity analysis of molecules.Internet J Chem1999,2.

Thorner, DA,Willett, P,Wright, PM,Taylor, R.Similarity searching in files of three‐dimensional chemical structures: representation and searching of molecular electrostatic potentials using field‐graphs.J Comput‐Aided Mol Des1997,11:163–174.

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 Sci2002,42:1043–1052.

Martin, YC,Bures, MG,Danaher, EA,DeLazzer, J,Lico, I,Pavlik, PA.A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists.Jf Comput‐Aided Mol Des1993,7:83–102.

Wolber, G,Seidel, T,Bendix, F,Langer, T.Molecule‐pharmacophore superpositioning and pattern matching in computational drug design.Drug Discov Today2008,13:23–29.

Available at: http://www.twisted‐helices.com/computing/rambin/rambin.html (AccessedNovember 11, 2010).

Available at: ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/ (AccessedNovember 11, 2010).

Pardalos, PM,Xue, J.The maximum clique problem.J Glob Opt1992,4:301–308.

Wood, DR.An algorithm for finding a maximum clique in a graph.Oper Res Lett1997,21:211–217.

Sokal, RR,Michener, CD.A statistical method for evaluating systematic relationships.Univ Kans Sci Bull1958,28:1409–1438.

Johnson, EG,Maggiora, GM,Concepts and Applications of Molecular Similarity.New York: John Wiley %26 Sons;1990.

Briem, H,Kuntz, ID.Molecular similarity based on DOCK‐generated fingerprints.J Med Chem1996,39:3401–3408.

MACCS Drug Data Report (MDDR).San Leandro, CA: MDL Information Systems Inc.

Lemmen, C,Lengauer, T,Klebe, G.FLEXS: a method for fast flexible ligand superposition.J Med Chem1998,41:4502–4520.

Berman, HM,Westbrook, J,Feng, Z,Gilliland, G,Bhat, TN,Weissig, H,Shindyalov, IN,Bourne, PE.The protein data bank.Nucleic Acids Res2000,28:235–242.

Bringmann, B.Don`be afraid of simpler patterns. In:10th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases.Berlin: Springer;2006, 55–66.

Schneider, G,Schneider, P,Renner, S.Scaffold‐hopping: how far can you jump?QSAR Comb Sci2006,25:1162–1171.

Korner, R,Apostolakis, J.Automatic determination of reaction mappings and reaction center information. 1. the imaginary transition state energy approach.J Chem Inf Model2008,48:1181–1189.

Apostolakis, J,Sacher, O,Korner, R,Gasteiger, J.Automatic determination of reaction mappings and reaction center information. 2. validation on a biochemical reaction database.J Chem Inf Model2008,48:1190–1198.

Kanehisa, M.The KEGG database.Novartis Foundation Symp2002,247:91–101; discussion101–103,119–128,244–252.

Reitz, M,Sacher, O,Tarkhov, A,Trumbach, D,Gasteiger, J.Enabling the exploration of biochemical pathways.Org Biomol Chem2004,2:3226–3237.

Cuadrado, MU,Ruiz, IL,Gomez‐Nieto, MA.QSAR models based on isomorphic and nonisomorphic data fusion for predicting the blood brain barrier permeability.J Comput Chem2007,28:1252–1260.

Maggiora, GM,Shanmugasundaram, V.Molecular similarity measures.Methods in Mol Biol (Clifton, N.J.)2004,275:1–50.

Willett, P,Barnard, JM,Downs, GM.Chemical similarity searching.J Chem Inf Comput Sci1998,38:983–996.

Gutman, I,Kortvelyesi, T.Wiener indices and molecular surfaces.Zeitschrift fur Naturforschung1995,50a:669–671.

Jain, BJ,Lappe, M.Joining softassign and dynamic programming for the contact map overlap problem. In proceedings of the 1st international conference on Bioinformatics research and development.BIRD2007.Berlin: Springer Heidelberg,410–424.

Godzik, A,Skolnick, J.Flexible algorithm for direct multiple alignment of protein structures and sequences.Comput Appl Biosci : CABIOS1994,10:587–596.

Gold, S,Rangarajan, A.A graduated assignment algorithm for graph matching.Pattern Anal and Machine Intell, IEEE, Trans on Pattern Anal and Machine Intell,1996,18:377–388.

Ishii, S,Sato, MA.Doubly constrained network for combinatorial optimization.Neurocomputing2002,43:239–257.

Strickland, DM,Barnes, E,Sokol, JS.Optimal protein structure alignment using maximum cliques.Oper Res2005,53:389–402.

Caboche, S,Pupin, M,Leclere, V,Fontaine, A,Jacques, P,Kucherov, G.NORINE: a database of nonribosomal peptides.Nucleic Acids Res2008,36:326–331.

Artymiuk, P,Spriggs, R,Willett, P.Graph theoretic methods for the analysis of structural relationships in biological macromolecules.J Am Soc Inf Sci Technol2005,56:518–528.