Algorithms for the Identification of Three-Dimensional Maximal Common Substructures

Journal of Chemical Information and Computer Sciences

Volumn 27, Issue 4, 1987, Pages 152-158

  Brint, Andrew T ^a   Willett, Peter ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DRUG PRODUCTS - RESEARCH; INFORMATION RETRIEVAL SYSTEMS - ONLINE SEARCHING; INFORMATION SCIENCE - INFORMATION RETRIEVAL;

3-D MAXIMAL COMMON SUBSTRUCTURES; CAMBRIDGE CRYSTALLOGRAPHIC DATA BANK; CLIQUE-DETECTION ALGORITHM; CRANDELL-SMITH ALGORITHM;

COMPUTER PROGRAMMING;

EID: 0023456962     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci00056a002     Document Type: Article

References (27)

1. Cone, M.M.; Venkataraghavan, R.; McLafferty, F.W. “Molecular Structure Comparison Program for the Identification of Maximal Common Substructures”. J. Am. Chem. Soc. 1977, 99, 7668–7671
2. Cammarata, A.; Menon, G.K. “Pattern Recognition. Classification of Therapeutic Agents According to Pharmacophores”. J. Med. Chem. 1976, 19, 739–748
3. Streich, W.J.; Franke, R. “Topological Pharmacophores. New Methods and Their Application to a Set of Antimalarials. Part 1: The Methods LOGANA and LOCON”. Quant. Struct.-Act. Relat. 1985, 4, 13–18
4. McGregor, J.J.; Willett, P. “Use of a Maximal Common Subgraph Algorithm in the Automatic Identification of the Ostensible Bond Changes Occurring in Chemical Reactions”. J. Chem. Inf. Comput. Sci. 1981, 21, 137–140
5. Willett, P., Ed. Modern Approaches to Chemical Reaction Searching; Gower: Aldershot, U.K., 1986
6. Bersohn, M.; Fujiwara, S.; Fujiwara, Y. “A Method for the Machine Detection of Near Equivalence of Major Substructures in a Molecule”. J. Comput. Chem. 1986, 7, 129–139
7. Willett, P. “Similarity and Clustering Methods in Chemical Information Systems”; Research Studies: Letchworth, U.K., 1987
8. Gund, P. “Three-Dimensional Pharmacophoric Pattern Searching”. Prog. Mol. Subcell. Biol. 1977, 5, 117–143
9. Gund, P. “Pharmacophoric Pattern Searching and Receptor Mapping”. Annu. Rep. Med. Chem. 1979, 14, 299–308
10. Jakes, S.E.; Willett, P. “Pharmacophoric Pattern Matching in Files of 3-D Chemical Structures: Selection of Interatomic Distance Screens”. J. Mol. Graphics 1986, 4, 12–20
11. Jakes, S.E.; Watts, N.; Willett, P.; Bawden, D.,; Fisher, J.D. “Pharmacophoric Pattern Matching in Files of 3-D Chemical Structures: Evaluation of Search Performance”. J. Mol. Graphics 1987, 5, 41–48
12. Brint, A.T.; Willett, P. “Pharmacophoric Pattern Matching in Files of 3-D Chemical Structures: Comparison of Geometric Searching Algorithms”. J. Mol. Graphics 1987, 5, 49–56
13. Crandell, C.W.; Smith, D.H. “Computer-Assisted Examination of Compounds for Common Three-Dimensional Substructures”. J. Chem. Inf. Comput. Sci. 1983, 23, 186–197
14. Barrow, H.G.; Burstall, R.M. “Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques”. Inf. Proc. Lett. 1976, 4, 83–84
15. Barrow, H.G.; Tenenbaum, J.M. “Computational Vision”. Proc. IEEE 1981, 69, 572–595
16. Levi, G. “A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs”. Calcolo 1972, 9, 341–352
17. Golender, V.; Rozenblit, A. “Logical and Combinatorial Algorithms for Drug Design”; Research Studies: Letchworth U.K., 1983
18. Kuhl, F.S.; Crippen, G.M.; Friesen, D.K. “A. Combinatorial Algorithm for Calculating Ligand Binding”, J. Comput. Chem. 1984, 5, 24–34
19. McGregor, J.J. “Backtrack Search Algorithms and the Maximal Common Subgraph Problem”. Software Pract. Exper. 1982, 12, 23–34
20. Bron, C.; Kerbosch, J. “Algorithm 457. Finding All Cliques of an Undirected Graph”. Commun. ACM 1973, 16, 575–577
21. Gerhards, L.; Lindenberg, W. “Clique Detection for Nondirected Graphs: Two New Algorithms”. Computing 1979, 21, 295–322
22. Loukakis, E.; Tsouros, C. “A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically”. Computing 1981, 27, 349–366
23. Loukakis, E. “A New Backtracking Algorithm for Generating the Family of Maximal Independent Sets of a Graph”. Comput. Math. Appl. 1983, 9, 83–589
24. Allen, F.H.; Bellard, S.; Brice, M.D.; Cartwright, B.A.; Doubleday, A.; Higgs, H.; Hummelink, T.; Hummelink-Peters, B.G.; Kennard, O.; Motherwell, W.D.S.; Rogers, J.R.; Watson, D.G. “The Cambridge Crystallographic Data Centre: Computer-Based Search, Retrieval Analysis and Display of Information”. Acta Crystallogr., Sect. B: Struct. Crystallogr. Cryst. Chem. 1979, 35, 2331–2339
25. Lesk, A.M. “Detection of 3-D Patterns of Atoms in Chemical Structures”. Commun. ACM 1979, 22, 219–224
26. Esaki, T. “Quantitative Drug Design Studies. V. Approach to Lead Generation by Pharmacophoric Pattern Searching”. Chem. Pharm. Bull. 1982, 30, 3657–3661
27. Ghose, A.K.; Crippen, G.M. “Geometrically Feasible Binding Modes of a Flexible Ligand Molecule at the Receptor Site”. J. Comput. Chem. 1986, 6, 350–359