Selection of reagents for combinatorial synthesis using clique detection

Quantitative Structure-Activity Relationships

Volumn 17, Issue 3, 1998, Pages 232-236

  Gardiner, Eleanor J ^a   Holliday, John D ^a   Willett, Peter ^a   Wilton, David J ^a   Artymiuk, Peter J ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Babel algorithm; Clique detection; Dissimilarity based compound selection; Molecular diversity; Subset selection graph

Indexed keywords

GRAPH THEORY;

BABEL ALGORITHM; CLIQUE DETECTIONS; COMBINATORIAL SYNTHESIS; COMPOUND SELECTION; DATABASE SUBSETS; DISSIMILARITY-BASED COMPOUND SELECTION; GRAPH-THEORETIC PROBLEM; MOLECULAR DIVERSITY; SUBSET SELECTION; SUBSET-SELECTION GRAPH;

SYNTHESIS (CHEMICAL);

ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; DATA BASE; PRIORITY JOURNAL;

EID: 0031833463     PISSN: 09318771     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1521-3838(199806)17:03<232::aid-qsar232>3.3.co;2-1     Document Type: Article

References (25)

1. Willett, P., Using computational tools to analyze molecular diversity, In: DeWitt, S.H. and Czarnik, A.W. (Eds.), A Practical Guide to Combinatorial Chemistry, Washington: American Chemical Society, 1997, 17-48.
2. Special issue on "Computational methods for the analysis of molecular diversity", Perspect. Drug Discov. Design 7/8, 1-180 (1997).
3. Willett, P., Winterman, V. and Bawden, D., Implementation of non-hierarchic cluster analysis methods in chemical information systems: selection of compounds for biological testing and clustering of substructure search output. J. Chem. Inform. Comput. Sci. 26, 109-118 (1986).
4. Sheridan, R.P. and Kearsley, S.K., Using a genetic algorithm to suggest combinatorial libraries. J. Chem. Inform. Comput. Sci. 35, 310-320 (1995).
5. Pickett, S.D., Mason, J.S. and McLay, I.M., Diversity profiling and design using 3D pharmacophores: pharmacophore-derived queries (PDQ). J. Chem. Inform. Comput. Sci. 36, 1214-1223 (1996).
6. Pardalos, P. M. and Xue, J., The maximum clique problem. J. Global Optimiz. 4, 301-328 (1994).
7. Johnson, D.S. and Trick, M.A. (Eds.), Cliques, Colouring and Satisfying: Second DIMACS Implementation Challenge, Bellcore, American Mathematical Society, 1996.
8. Brown, R.D. and Martin, Y.C., Use of structure-activity data to compare structure-based clustering methods and descriptors for use in compound selection. J. Chem. Inform. Comput. Sci. 36, 572-584 (1996).
9. Brown, R.D. and Martin, Y.C., The information content of 2D and 3D structural descriptors relevant to ligand-receptor binding. J. Chem. Inform. Comput. Sci. 37, 1-9 (1997).
10. Ferguson, A.M., Patterson, D.E., Garr, C.D. and Underiner, T.L., Designing chemical libraries for lead discovery. J. Biomol. Screening 1, 65-73 (1996).
11. Patterson, D.E., Cramer, R.D., Ferguson, A.M., Clark, R.D. and Weinberger, L.E., Neighbourhood behaviour: a useful concept for validation of "molecular diversity" descriptors. J. Med. Chem. 39, 3049-3059 (1996).
12. Matter, H., Selecting optimally diverse compounds from structure databases: a validation study of two-dimensional and three-dimensional molecular descriptors. J. Med. Chem. 40, 1219-1229 (1997).
13. Snarey, M., Terrett, N.K., Willett, P. and Wilton, D.J., Comparison of algorithms for dissimilarity-based compound selection. J. Mol. Graph. Model. in the press.
14. Brint, A.T. and Willett, P., Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Inform. Comput. Sci. 27, 152-158 (1987).
15. Martin, Y.C., Bures, M.G., Danaher, E.A., DeLazzler, J., Lico, I. and Pavlik, P., A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists. J. Comput.-Aid. Mol. Design 7, 83-102 (1993).
16. Moon, J.B. and Howe, W.J., 3D database searching and de novo construction methods in molecular design. Tetrahedr. Comput. Method. 3, 697-711 (1990).
17. Grindley, H.M., Artymiuk, P.J., Rice, D.W. and Willett, P., Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J. Mol. Biol. 229, 707-721 (1993).
18. Bron, C. and Kerbosch, J., Algorithm 457. Finding all cliques of an undirected graph. Comm. ACM 16, 575-577 (1973).
19. Gardiner, E.J., Artymiuk, P.J. and Willett, P., Clique-detection algorithms for matching three-dimensional molecular structures. J. Mol. Graph. Model. in the press.
20. Carraghan, R. and Pardalos, P.M., Exact algorithm, for the maximum clique problem. Operations Res. Lett. 9, 375-382 (1990).
21. Babel, L., Finding maximum cliques in arbitrary and special graphs. Computing, 46, 321-341 (1991).
22. Shindo, M. and Tomita, E., Simple algorithm, for finding a maximum clique and its worst-case complexity. Systems and Computers in Japan, 27(3), 1-13 (1990).
23. Balas, E. and Yu, C.S., Finding a maximum clique in an arbitrary graph. SIAM J. Comput., 15, 1054-1068 (1986).
24. Holliday, J.D. and Willett, P., Definitions of "dissimilarity" for dissimilarity-based compound selection. J. Biomol. Screening, 1, 145-151 (1996).
25. Polinsky, A., Feinstein, R.D., Shi, S. and Kuki, A., LiBrain: software for automated design of exploratory and targeted combinatorial libraries. In: Chaiken, I.M. and Janda, K.D. (Eds.) Molecular Diversity and Combinatorial Chemistry. Libraries and Drug Discovery. Washington: American Chemical Society, 1996, 219-232.