Clique-detection algorithms for matching three-dimensional molecular structures

Journal of Molecular Graphics and Modelling

Volumn 15, Issue 4, 1997, Pages 245-253

  Gardiner, Eleanor J ^a   Artymiuk, Peter J ^a   Willett, Peter ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Bron Kerbosch algorithm; Carraghan Pardalos algorithm; Clique detection; Graph matching; Maximal common substructure; Pharmacophore mapping

Indexed keywords

CARBOXYPEPTIDASE A; CYTOSOL AMINOPEPTIDASE; RIBONUCLEASE H; RNA DIRECTED DNA POLYMERASE;

ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; COMPUTER PROGRAM; DATA BASE; PRIORITY JOURNAL; PROTEIN DOMAIN; PROTEIN STRUCTURE; PROTEIN TERTIARY STRUCTURE; THREE DIMENSIONAL IMAGING;

ALGORITHMS; COMPUTER GRAPHICS; IMAGE PROCESSING, COMPUTER-ASSISTED; MOLECULAR STRUCTURE; PROTEINS;

EID: 0031410097     PISSN: 10933263     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1093-3263(97)00089-2     Document Type: Article

References (42)

1. Ash J.E., Warr W.A., Willett P. Chemical Structure Systems. 1991;Ellis Horwood, Chichester.
2. Good A.C., Mason J.S. Three-dimensional structure database searches. Rev. Comput. Chem. 7:1996;67.
3. Martin, Y.C. and Willett, P. (eds.). Designing Bioactive Molecules: Three-Dimensional Techniques and Applications. American Chemical Society, Washington, D.C., in press.
4. Read R.C., Corneil D.G. The graph isomorphism disease. J. Graph Theory. 1:1977;339.
5. Gati G. Further annotated bibliography on the isomorphism disease. J. Graph Theory. 3:1979;95.
6. McGregor J.J. Backtrack search algorithms and the maximal common subgraph problem. Software Pract. Experience. 12:1982;23.
7. Willett P. Three-Dimensional Chemical Structure Handling. 1991;Research Studies Press, Taunton.
8. Crandell C.W., Smith D.H. Computer-assisted examination of compounds for common three-dimensional substructures. J. Chem. Inf. Comput. Sci. 23:1983;186.
9. Brint A.T., Willett P. Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Inf. Comput. Sci. 27:1987;152.
10. Levi G. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo. 9:1972;341.
11. Barrow H.G., Burstall R.M. Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Proc. Lett. 4:1976;83.
12. Pardalos P.M., Xue J. The maximum clique problem. J. Global Optimization. 4:1994;301.
13. Johnson D.S., Trick M.A. Cliques, Coloring and Satisfiability Second DIMACS Implementation Challenge . 1996;Bellcore and the American Mathematical Society.
14. Bron C., Kerbosch J. Algorithm 457. Finding all cliques of an undirected graph. Commun. ACM. 16:1973;575.
15. Martin Y.C., Bures M.G., Danaher E.A., DeLazzer J., Lico I., Pavlik P.A. A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists. J. Comput.-Aided Mol. Design. 7:1993;83.
16. Brint A.T., Willett P. Upperbound procedures for the identification of similar three-dimensional chemical structures. J. Comput.-Aided Mol. Design. 2:1988;311.
17. Moon J.B., Howe W.J. 3D database searching and de novo construction methods in molecular design. Tetrahedron Comput. Methodol. 3:1990;697.
18. Ho C.M.W., Marshall G.R. FOUNDATION A program to retrieve all possible structures containing a user-defined minimum number of matching query elements from three-dimensional databases . J. Comput.-Aided Mol. Design. 7:1993;3.
19. Grindley H.M., Artymiuk P.J., Rice D.W., Willett P. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J. Mol. Biol. 229:1993;707.
20. Artymiuk P.J., Grindley H.M., MacKenzie A.B., Rice D.W., Ujah E.C., Willett P. PROTEP A program for graph-theoretic similarity searching of the 3-D structures in the Protein Data Bank . Carbo R. Molecular Similarity and Reactivity from Quantum Chemical to Phenomenological Approaches . 1995;123-140 Kluwer Academic Publishers, Dordrecht, The Netherlands.
21. Mitchell E.M., Artymiuk P.J., Rice D.W., Willett P. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. J. Mol. Biol. 212:1990;151.
22. Bernstein F.C., Koetzle T.F., Williams G.J.B., Meyer E.F. Jr, Brice M.D., Rodgers J.R., Kennard O., Shimanouchi M., Tasumi M. The Protein Data Bank A computer-based archival file for macromolecular structures . J. Mol. Biol. 112:1977;535.
23. Artymiuk P.J., Grindley H.M., Kumar K., Rice D.W., Willett P. Three-dimensional structural resemblance between the ribonuclease H and connection domains of HIV reverse-transcriptase revealed using graph theoretical techniques. FEBS Lett. 324:1993;15.
24. Artymiuk P.J., Grindley H.M., Park J.E., Rice D.W., Willett P. Three-dimensional structural resemblance between leucine aminopeptidase and carboxypeptidase A revealed by graph-theoretical techniques. FEBS Lett. 303:1992;48.
25. Artymiuk P.J., Poirrette A.R., Rice D.W., Willett P. A polymerase I palm in adenyl cyclase? Nature (London). 388:1997;33.
26. Babel L. Finding maximum cliques in arbitrary and special graphs. Computing. 46:1991;321.
27. Balas E., Yu C.S. Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15:1986;1054.
28. Carraghan R., Pardalos P.M. Exact algorithm for the maximum clique problem. Operations Res. Lett. 9:1990;375.
29. Gendreau M., Picard J.C., Zubieta L. An efficient implicit enumeration algorithm for the maximum clique problem. Lecture Notes Econ. Math. Syst. 304:1988;70.
30. Shindo M., Tomita E. Simple algorithm for finding a maximum clique and its worst-case time complexity. Syst. Comput. Jpn. 21:(3):1990;1.
31. Gardiner, E.J. An Evaluation of a New Clique-Detection Procedure for Matching Chemical Structures. MSc dissertation. University of Sheffield, Sheffield, UK, 1996.
32. Lin F. Parallel computation network for the maximum clique problem. Proceedings of the IEEE International Symposium on Circuits and Systems. 1993;2549-2552 IEEE, Piscataway, NJ.
33. Tarjan R.E., Trojanowski A.E. Finding a maximum independent set. SIAM J. Comput. 6:1977;537.
34. Friden C., Hertz A., de Werra D. Tabaris An exact algorithm based on tabu search for finding a maximum independent set in a graph . Comput. Operations Res. 17:1990;437.
35. Manino C., Sassano A. An exact algorithm for the maximum stable set problem. J. Comput. Optimization Appl. 3:1993;243.
36. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
37. Grötschel M., Lovász L., Schrijver A. Polynomial algorithms for perfect graphs. Ann. Discrete Math. 21:1984;325.
38. Tomita, E. and Fujii, E. Efficient method of finding a maximum clique and its experimental evaluation. J. Soc. Signal Proc. 1985, J68-D(3), 221.
39. DePriest S.A., Mayer D., Naylor C.B., Marshall G.A. 3D-QSAR of angiotensin-converting enzyme and thermolysin inhibitors A comparison of CoMFA models based on deduced and experimentally determined active site geometries . J. Am. Chem. Soc. 115:1993;5372.
40. Rault S., Bureau R., Pilo J.C., Robba M. Comparative molecular field analysis of CCK-A antagonists using field-fit as an alignment technique. A convenient guide to design new CCK-A ligands. J. Comput.-Aided Mol. Design. 6:1992;553.
41. McFarland J.W. Comparative molecular field analysis of anticoccidial triazines. J. Med. Chem. 35:1992;2543.
42. Artymiuk P.J., Poirrette A.R., Grindley H.M., Rice D.W., Willett P. A graph-theoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures. J. Mol. Biol. 243:1994;327.