Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm

Journal of Chemical Information and Computer Sciences

Volumn 42, Issue 2, 2002, Pages 305-316

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

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL GRAPHS;

ALGORITHMS; CHEMICAL BONDS; HEURISTIC METHODS; MOLECULAR STRUCTURE;

GRAPH THEORY;

EID: 0036522746     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci010381f     Document Type: Article

References (48)

1. Johnson, M.; Maggiora, G. Concepts and Applications of Molecular Similarity; 1990.
2. Willett, P.; Barnard, J.; Downs, G. Chemical Similarity Searching. J. Chem. Inf. Comput. Sci. 1998, 38, 983-996.
3. Dean, P.M. Molecular Similarity in Drug Design; Chapman and Hall: 1994.
4. Sanfeliu, A.; Fu, K.S. A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Trans. Syst. Man, Cybern. 1983, 13, 353-362.
5. Bunke, H.; Shearer, K. A Graph Distance Metric Based on the Maximal Common Subgraph. Pattern Recogn. Lett. 1998, 19, 255-259.
6. Balaz, V.; Jaroslav, K.; Kvasnicka, V.; Milan, S. A Metric for Graphs. Casopis Pest. Mater. 1986, 111,431-433, 435.
7. Johnson, M.; Naim, M.; Nicholson, V.; Tsai, C. Unique Mathematical Features of the Substructure Metric Approach to Quantitative Molecular Similarity Analysis. In Graph Theory and Topology in Chemistry; King, R.B., Rouvray, D.H., Eds.; Elsevier Science Publishers: 1987; pp 219-225.
8. Bersohn, M. An Algorithm for Finding the Intersection of Molecular Structures. J. Chem. Soc. Perk. Trans. 1 1982, 1, 631-637.
9. Cone, M.; Venkataraghavan, R.; McLafferty, F. Molecular Structure Comparison Program for the Identification of Maximal Common Substructures. J. Am. Chem. Soc. 1977, 99, 7668-7671.
10. Takahashi, Y.; Satoh, Y.; Sasaki, S. Recognition of Largest Common Structural Fragment Among a Variety of Chemical Structures. Anal. Sci. 1987, 3, 23-28.
11. Raymond, J.; Gardiner, E.; Willett, P. RASCAL: Calculation of Graph Similarity Using Maximum Common Edge Subgraphs. Comput. J. submitted for publication.
12. Kann, V. On the Approximability of NP-Complete Optimization Problems; Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology: Stockholm, Sweden, 1992.
13. Brown, R.D. A Hyperstructure Model for Chemical Structure Handling; Ph.D. Thesis, Department of Information Studies, University of Sheffield: Sheffield, U.K., 1993.
14. Levi, G. A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs. Calcolo 1972, 9, 341-352.
15. Barrow, H.; Burstall, R. Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Inf. Proc. Lett. 1976, 4, 83-84.
16. Vizing, V.G. Reduction of the Problem of Isomorphism and Isomorphic Entrance to the Task of Finding the Nondensity of a Graph (in Russian). In Third All-Union Conference on Problems of Theoretical Cybernetics; Novosibirsk, 1974; p 124.
17. Pelillo, M.; Siddiqi, K.; Zucker, S.W. Matching Hierarchical Structures Using Association Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 1999, 21, 1105-1120.
18. Bessonov, Y.E. 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 (in Russian). Vychisl. Sistemy 1985, 3-22, 121.
19. Skorobogatov, V.A. Determination of Common Parts in Families of Graphs (in Russian). In Applied Problems on Graphs and Networks; Akad. Nauk SSSR Sibirsk, Otdel.: Vychisl. Tsentr, 1981; pp 117-132.
20. Bessonov, Y.E. Determination of the Intersections of Geometric Graphs by Means of the Operation of the Modular Product (in Russian). Vychisl. Sistemy 1987, 43-48, 114.
21. Adamson, G.; Lambourne, D.; Lynch, M. Analysis of Structural Characteristics of Chemical Compounds in a Large Computer-based File. Part III. Statistical Association of Fragment Incidence. J. Chem. Soc., Perkin Trans. 1 1972, 2428-2433.
22. Whitney, H. Congruent Graphs and the Connectivity of Graphs. Am. J. Math. 1932, 54, 150-168.
23. Nicholson, V.; Tsai, C.; Johnson, M.; Nalm, M. A Subgraph Isomorphism Theorem for Molecular Graphs. In Graph Theory and Topology in Chemistry; King, R.B., Rouvray, D.H., Eds.; Elsevier: 1987; pp 226-230.
24. Kvasnicka, V.; Pospichat, J. Maximal Common Subgraphs of Molecular Graphs. Reports in Molecular Theory 1990, 1, 99-106.
25. Durand, P. An Improved Program for Topological Similarity Analysis of Molecules; M.S. Thesis, Department of Mathematics and Computer Science, Kent State: Toledo, OH, 1996.
26. Durand, P.; Pasari, R.; Baker, J.; Tsai, C. An Efficient Algorithm for Similarity Analysis of Molecules. Internet J. Chem. 1999, 2, 1-12.
27. Chen, C.K.; Yurt, D.Y. Unifying Graph Matching Problems with a Practical Solution. In International Conference on Systems, Signals, Control, Computer; Durban, South Africa, 1998.
28. Brown, R.D.; Jones, G.; Willett, P.; Glen, R. Matching Two-Dimensional Chemical Graphs Using Genetic Algorithms. J. Chem. Inf. Comput. Sci. 1994, 34, 63-70.
29. Figueras, J. Ring Perception Using Breadth-First Search. J. Chem. Inf. Comput. Sci. 1996, 36, 986-991.
30. Takahashi, Y. Automatic Extraction of Ring Substructures from a Chemical Structure. J. Chem. Inf. Comput. Sci. 1994, 34, 167-170.
31. Chaudhuri, P. A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph. J. Comput. System Sci. 1999, 59, 84-93.
32. Hanser, T.; Janffret, P.; Kaufman, G. A New Algorithm for Exhaustive Ring Perception in a Molecular Graph. J. Chem. Inf. Comput. Sci. 1996, 36, 1146-1152.
33. Syslo, M. An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph. SIAM J. Comput. 1981, 10, 797-808.
34. Alon, N.; Yuster, R.; Zwick, U. Finding and Counting Given Length Cycles. Algorithmica 1997, 17, 209-223.
35. Richards, D. Finding Cycles of a Given Length. In Cycles in Graphs; Burnaby, B.C., Ed.; North-Holland, 1982; pp 249-255.
36. Kahn, A.; Singh, H. Petri Net Approach to Enumerate All Simple Paths in a Graph. Electron. Lett. 1980, 16, 291-292.
37. Misra, R. An Algorithm for Enumerating All Simple Paths in a Communication Network. Microelectron. Reliab. 1979, 19, 363-366.
38. Aziz, M.; Sobham, M.; Samad, M. Fast Enumeration of Every Path in a Reliability Graph Using Subgraphs. Microelectron. Reliab. 1994, 34, 1395-1396.
39. Aihara, K. Approach to Enumerating Elementary Paths and Cutsets by Gaussian Elimination Method. Electron. Commun. Jpn. 1975, 58, 1-10.
40. Cahit, I.; Cahit, R. Generation of Simple Paths of Graph by Decomposition. Electron. Lett. 1974, 10, 13-14.
41. Ullmann, J.R. An Algorithm for Subgraph Isomorphism. J. ACM 1976, 23, 31-42.
42. Randic, M.; Brissey, G.M.; Spencer, R.B.; Wilkins, C.L. Search for All Self-Avoiding Paths for Molecular Graphs. Comput. Chem. 1979, 3, 5-13.
43. Johnson, M. A Review and Examination of the Mathematical Spaces Underlying Molecular Similarity Analysis. J. Math. Chem. 1989, 3, 117-145.
44. Fernandez, M.L.; Valiente, G. A Graph Distance Metric Combining Maximum Common Subgraph and Minimum Common Supergraph; Research Report, LSI-01-2-R; Universitat Politecnica De Catalunya, 2001.
45. Wallis, W.D.; Shoubridge, P.; Kraetz, M.; Ray, D. Graph Distances Using Graph Union. Pattern Recogn. Lett. 2001, 22, 701-704.
46. ACB Blocks Ltd.; Moscow, Russia; (www.acbblock.com). Bakken, G.A.; Jurs, P.C. Classification of Multidrng-Resistance Reversal Agents Using Structure-Based Descriptors and Linear Discriminant Analysis. J. Med. Chem. 2000, 43, 4534-4541. Bionet Research; Camelford, U.K..; (www.bionetresearch.co.uk). ChemBridge; San Diego, CA, U.S.A.; (www.chembridge.com). IFLab; Kiev, Russia; (www.iflab.kiev.na). Nanosyn; Mountain View, CA, U.S.A.; (www.nanosyn.com). TimTec; Newark, DE, U.S.A.; (www.timtec.net). Zelinsky Institute; Moscow, Russia; (www.zelinsky.com).
47. Flower, D.R. On the Properties of Bit String-Based Measures of Chemical Similarity. J. Chem. Inf. Comput. Sci. 1998, 38, 379-386.
48. Godden, J.; Xue, L.; Bajorath, J. Combinatorial Preferences Affect Molecular Similarity/Diversity Calculations Using Binary Fingerprints and Tanimoto Coefficients. J. Chem. Inf. Comput. Sci. 2000, 40, 163-166.