Common subgraph isomorphism detection by backtracking search

Software - Practice and Experience

Volumn 34, Issue 6, 2004, Pages 591-607

  Krissinel, Evgeny B ^a   Henrick, Kim ^a  

^a EUROPEAN BIOINFORMATICS INSTITUTE   (United Kingdom)

Author keywords

Backtracking algorithm; Common subgraphs

Indexed keywords

ALGORITHMS; CHEMICAL BONDS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; VECTORS;

BACKTRACKING; COMMON SUBGRAPH; VERTICES;

PATTERN RECOGNITION;

EID: 2342491596     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.588     Document Type: Article

References (34)

1. Rouvray DH, Balaban AT. Chemical applications of graph theory. Applications of Graph Theory, Wilson RJ, Beineke LW (eds.). Academic Press: New York, 1979; 177-221.
2. Mitchell EM, Artymiuk PJ, Rice DW, Willett P. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. Journal of Molecular Biology 1990; 212:151-166.
3. Grindley HM, Artymiuk PJ, Rice DW, Willett P. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. Journal of Molecular Biology 1993; 229:707-721.
4. Kuhl F, Crippen G, Friesen D. A combinatorial algorithm for calculating ligand binding. Journal of Computational Chemistry 1984; 5:24-34.
5. 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. Journal of Computer-Aided Molecular Design 1997; 11:163-174.
6. Bruno IJ, Kemp NM, Artymiuk PJ, Willett P. Representation and searching of carbohydrate structures using graph-theoretic techniques. Carbohydrate Research 1997; 304:61-67.
7. Gardiner EJ, Willett P, Artymiuk PJ. Graph-theoretic techniques for macromolecular docking. Journal of Chemical Information and Computer Science 2000; 40:273-279.
8. McGregor J, Willett P. Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions. Journal of Chemical Information and Computer Science 1981; 21:137-140.
9. Arita M. Graph modeling of metabolism. Journal of the Japanese Society of Artificial Intelligence 2000; 15:703-710.
10. Chen L, Robien W. Application of the maximal common substructure algorithm to automatic interpretation of 13C-NMR spectra. Journal of Chemical Information and Computer Science 1994; 34:934-941.
11. Cone M, Venkataraghavan R, McLafferty F. Computer-aided interpretation of mass spectra. 20. Molecular structure comparison program for the identification of maximal common substructures. Journal of the American Chemistry Society 1977; 99:7668-7671.
12. Gifford E, Johnson M, Smith D, Tsai C. Structure-reactivity maps as a tool for visualizing xenobiotic structure-reactivity relationships. Network Science 1996; 2:1-33.
13. Raymond J, 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:59-71.
14. Edgar SJ, Holliday JD, Willett P. Effectiveness of retrieval in similarity searches of chemical databases: A review of performance measures. Journal of Molecular Graphics and Modelling 2000; 18:343-357.
15. Horaud R, Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence 1989; 11:1168-1180.
16. Pelillo M, Siddiqi K, Zucker SW. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 1999; 21:1105-1120.
17. Yang B, Snyder W, Bilbro G. Matching oversegmented 3D images to models using association graphs. Image and Vision Computing 1989; 7(2):135-143.
18. Pla F, Merchant J. Matching feature points in image sequences through a region-based method. Computer Vision Image Understanding 1997; 66:271-285.
19. Shearer K, Bunke H, Venkatesh S. Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition 2001; 34:1075-1091.
20. Raymond J, Willett P. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design 2002; 16:521-533.
21. Bunke H. Recent advances in structural pattern recognition with applications to visual form analysis. Visual Form 2001 (Lecture Notes in Computer Science, vol. 2059), Arcelli C, Cordella L, Sanniti di Baja G (eds.). Springer: Berlin, 2001; 11-23.
22. Levi G. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 1972; 9:341-354.
23. Bron C, Kerbosch J. Algorithm 457 - finding all cliques of an undirected graph. Communications of the ACM 1973; 16:575-577.
24. McGregor J. Backtrack search algorithms and the maximal common subgraph problem. Software - Practice and Experience 1982; 12:23-34.
25. Ullman JR. An algorithm for subgraph isomorphism. Journal of the Association of Computers and Machines 1976; 23(1):31-42.
26. Boutselakis H et al. E-MSD: The European Bioinformatics Institute Macromolecular Structure Database. Nucleic Acids Research 2003; 31(1):458-462.
27. Potterton E, McNicholas S, Krissinel E, Cowtan K, Noble M. The CCP4 molecular-graphics project. Acta Crystallography 2002; D58:1955-1957.
28. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE. The Protein Data Bank. Nucleic Acids Research 2000; 28:235-242.
29. Bunke H, Foggia P, Guidobaldi C, Sansone C, Vento M. A Comparison of Algorithms for Maximal Common Subgraph on Randomly Connected Graphs (Lecture Notes in Computer Science, vol. 2396). Springer: Heidelberg, 2002; 123-132.
30. Cordella LP, Foggia P, Sansone C, Vento M. An improved algorithm for matching large graphs. Proceedings of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations, Italy. CVEN Ed., 2001; 149-159.
31. Messmer BT, Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 1998; 20:493-504.
32. Messmer BT, Bunke H. Error-correcting graph isomorphism using decision trees. International Journal on Pattern Recognition and Artificial Intelligence 1998; 12:721-742.
33. Messmer BT, Bunke H. Efficient subgraph isomorphism detection: A decomposition approach. IEEE Transactions on Knowledge and Data Engineering 2000; 12:307-323.
34. Collaborative Computational Project, Number 4. The CCP4 Suite: Programs for protein crystallography. Acta Crystallography D 1994; 50:760-763.