RASCAL: Calculation of graph similarity using maximum common edge subgraphs

Computer Journal

Volumn 45, Issue 6, 2002, Pages 631-644

  Raymond, John W ^a   Gardiner, Eleanor J ^b   Willett, Peter ^b  

^a PFIZER INC   (United States)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; EDGE DETECTION; HEURISTIC METHODS; INFORMATION MANAGEMENT;

EDGE SUBGRAPHS;

GRAPH THEORY;

EID: 0036448558     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.6.631     Document Type: Article

References (41)

1. Kuhl, F., Crippen, G. and Friesen, D. (1984) A combinatorial algorithm for calculating ligand binding. J. Comp. Chem., 5, 24-34.
2. Shearer, K., Bunke, H. and Venkatesh, S. (2001) Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recog., 34, 1075-1091.
3. Horaud, R. and Skordas, T. (1989) Stereo correspondence through feature grouping and Maximal Cliques. IEEE Trans. Pattern Anal. Mach. Intell., 11, 1168-1180.
4. Pelillo, M., Siddiqi, K. and Zucker, S.W. (1999) Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell., 21, 1105-1120.
5. Trinajstic, N. (1992) Chemical Graph Theory. CRC Press, Boca Raton, FL.
6. Willett, P. (1999) Matching of chemical and biological structures using subgraph and maximal common subgraph isomorphism algorithms. IMA Vol. Math. Appl., 108, 11-38.
7. Gifford, E., Johnson, M., Smith, D. and Tsai, C. (1996) Structure-reactivity maps as a tool for visualizing xenobiotic structure-reactivity. Network Science, 2, 1-33.
8. Lewis, R.A., Mason, J.S. and McLay, I.M. (1997) Similarity measures for rational set selection and analysis of combinatorial libraries: the diverse property-derived (DPD) approach. J. Chem. Inf. Comput. Sci., 37, 599-614.
9. Chen, L. and Robien, W. (1994) Application of the maximal common substructure algorithm to automatic interpretation of 13C NMR spectra. J. Chem. Inf. Comput. Sci., 34, 934-941.
10. Gillet, V.J., Wild, D.J., Willett, P. and Bradshaw, J. (1998) Similarity and dissimilarity methods for processing chemical structure databases. Comp. J., 41, 547-558.
11. Flower, D.R. (1998) On the properties of bit string-based measures of chemical similarity. J. Chem. Inf. Comput. Sci., 38, 379-386.
12. Diestel, R. (2000) Graph Theory. Springer, New York.
13. Sanfeliu, A. and Fu, K.S. (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man, Cybern., 13, 353-362.
14. Hansen, P. (1979) Upper bounds for the stability number of a graph. Rev. Roumaine Math. Pures Appl., 24, 1195-1199.
15. Liu, R.Y. (1989) An upper bound on the chromatic number of a graph. J. Xinjiang Univ. Natur. Sci., 6, 24-27.
16. Papadopoulos, A.N. and Manolopoulos, Y. (1999) Structure-based similarity search with graph histograms. In Proc. 10th Int. Workshop on Database and Expert Systems Applications, Florence, Italy, September 1-3, 1999, pp. 174-178. Springer, Berlin.
17. Johnson, M. (1985) Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry. In Alavi, Y., Chartrand, G., Lesniak, L., Lick, D. and Wall, C. (eds), Graph Theory and Its Applications to Algorithms and Computer Science, pp. 457-470. Wiley, New York.
18. Carpaneto, G., Martello, S. and Toth, P. (1988) Algorithms and codes for the assignment problem. Ann. Oper. Res., 13, 193-223.
19. Brown, R.D. and Martin, Y.C. (1996) Use of structure-activity data to compare structure-based clustering methods and descriptors for use in compound selection. J. Chem. Inf. Comput. Sci., 36, 572-584.
20. Patterson, D.E., Cramer, R.D., Ferguson, A.M., Clark, R.D. and Weinberger, L.E. (1996) Neighborhood behavior: a useful concept for validation of 'molecular diversity' descriptors. J. Med. Chem., 39, 3049-3059.
21. Levi, G. (1972) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9, 341-352.
22. Barrow, H. and Burstall, R. (1976) Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Proc. Lett., 4, 83-84.
23. Vizing, V.G. (1974) Reduction of the problem of isomorphism and isomorphic entrance to the task of finding the nondensity of a graph. In Proc. Third All-Union Conference on Problems of Theoretical Cybernetics, Novosibirsk, p. 124 (in Russian).
24. Whitney, H. (1932) Congruent graphs and the connectivity of graphs. Amer. J. Math., 54, 150-168.
25. Nicholson, V., Tsai, C., Johnson, M. and Naim, M. (1987) A subgraph isomorphism theorem for molecular graphs. In King, R.B. and Rouvray, D.H. (eds), Graph Theory and Topology in Chemistry. Elsevier, Athens, GA.
26. Kvasnicka, V. and Pospichal, J. (1990) Maximal common subgraphs of molecular graphs. Reports Molecular Theory, 1, 99-106.
27. Pardalos, P. and Xue, J. (1994) The maximum clique problem. J. Global Optimiz, 4, 301-328.
28. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability. W.H. Freeman, San Francisco, CA.
29. Grimmett, G.R. and McDiarmid, C.J.H. (1975) On colouring random graphs. Math. Proc. Camb. Phil. Soc., 77, 313-324.
30. Manvel, B. (1981) Coloring large graphs. Congr. Numer., 33, 197-204.
31. Wood, D. (1997) An algorithm for finding a maximum clique in a graph. Oper. Res. Lett., 21, 211-217.
32. Bessonov, Y.E. (1985) On the solution of a problem on the search for the best intersection of graphs on the basis of an analysis of the projections of the subgraphs of the modular product. Vychisl. Sistemy, 121, 3-22 (in Russian).
33. Selkow, S. (1978) New bounds for the clique number of a graph. Inf. Proc. Lett., 7, 173-174.
34. Kikusts, P. (1986) Another algorithm determining the independence number of a graph. Elektron. Inf. Verarb. Kybern., 22, 157-166.
35. Faulon, J.L. (1998) Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs. J. Chem. Inf. Comput. Sci., 38, 432-444.
36. Fan, B.T., Barbu, A., Panaye, A. and Doucet, J.P. (1996) Detection of constitutionally equivalent sites from a connection table. J. Chem. Inf. Comput. Sci., 36, 654-659.
37. Fan, B.T., Panaye, A. and Doucet, J.P. (1999) Comment on 'Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs'. J. Chem. Inf. Comput. Sci., 39, 630-631.
38. Teh, H.H. and Chen, C.C. (1970) On the automorphism groups of interchanged graphs. Nanta Math., 4, 72-78.
39. Ostergard, P. (2002) A fast algorithm for the maximum clique problem. Discrete Appl. Math., 120, 195-205.
40. Raymond, J., Gardiner, E. and Willett, P. (2002) Heuristics for rapid similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J. Chem. Inf. Comput. Sci., 42, 305-316.
41. Willett, P., Barnard, J. and Downs, G. (1998) Chemical similarity searching. J. Chem. Inf. Comput. Sci., 38, 983-996.