A scalable approach to combinatorial library design for drug discovery

Journal of Chemical Information and Modeling

Volumn 48, Issue 1, 2008, Pages 27-41

  Sharma, Puneet ^a,b   Salapaka, Srinivasa ^a,b   Beck, Carolyn ^a,b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL EFFICIENCY; PHARMACODYNAMICS; PROBLEM SOLVING;

COMBINATORIAL LIBRARY DESIGN; DRUG DISCOVERY; SCALABLE APPROACH;

ALGORITHMS;

ALGORITHM; ARTICLE; CHEMICAL MODEL; COMBINATORIAL CHEMISTRY; COMPUTER SIMULATION; DRUG DESIGN; DRUG SCREENING; METHODOLOGY; MOLECULAR LIBRARY; PROBABILITY; TIME;

ALGORITHMS; COMBINATORIAL CHEMISTRY TECHNIQUES; COMPUTER SIMULATION; DRUG DESIGN; DRUG EVALUATION, PRECLINICAL; MARKOV CHAINS; MODELS, CHEMICAL; SMALL MOLECULE LIBRARIES; TIME FACTORS;

EID: 39449112501     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/ci700023y     Document Type: Article

References (53)

1. Demers, L.; Cioppa, G. D. Drug Discovery: Nanotechnology to Advance Discovery R&D. Genet. Eng. News 2003, 23.
2. Gersho, A.; Gray, R. Vector Quantization and Signal Compression, 1st ed.; Kluwer: Boston, Massachusetts, 1991.
3. Drezner, Z. Facility Location: A Survey of Applications and Methods; Springer-Verlag: New York, 1995; Springer Series in Operations Research.
4. Du, Q.; Faber, V.; Gunzburger, M. Centroidal Voronoi Tessellations: Applications and Algorithms. SIAM Rev. 1999, 41, 637-676.
5. Salapaka, S.; Khalak, A. Constraints on Locational Optimization Problems. In Proceedings of the IEEE Control and Decision Conference; IEEE: Los Alamitos, CA, 2003.
6. Cortés, J.; Martínez, S.; Karatas, T.; Bullo, F. Coverage Control for Mobile Sensing Networks: Variations on a Theme. Proceedings of the Mediterranean Conference on Control and Automation; Mediterranean Control Association: Notre Dame, IN, 2002.
7. Therrien, C. Decision, Estimation and Classification: An Introduction to Pattern Recognition and related topics, 1st ed.; Wiley: New York, 1989; Vol. 14.
8. Haykin, S. Neural Networks: A Comprehensive Foundation; Prentice Hall: Englewoods Cliffs, NJ, 1998.
9. Hartigan, J. Clustering Algorithms; Wiley: New York, 1975.
10. Gray, R.; Karnin, E. Multiple local minima in vector quantizers. IEEE Trans. Inf. Theory 1982, IT-28, 256-361.
11. Willett, P. Computational tools for the analysis of molecular diversity. Perspect. Drug Discovery Des. 1997, 7/8, 1-11.
12. Blaney, J.; Martin, E. Computational approaches for combinatorial library design and molecular diversity analysis. Curr. Opin. Chem. Biol. 1997, 1, 54-59.
13. Rassokhin, D. N.; Agrafiotis, D. K. Kolmogorov-Smirnov statistic and its applications in library design. J. Mol. Graphics Modell. 2000, 18, 370-384.
14. Lipinski, C. A.; Lomabardo, F.; Dominy, B. W.; Feeny, P. J. Experimental and Computational Approaches to estimate solubility and permeability in drug discovery and development setting. Adv. Drug Delivery Rev. 1997, 23, 2-25.
15. Higgs, R. E.; Bemis, K. G.; Watson, I. A.; Wikel, J. H. Experimental designs for selecting molecules from large chemical databases. J. Chem. Inf. Comput. Sci. 1997, 37, 861-870.
16. Snarey, M.; Terrett, N.; Willet, P.; Wilton, D. J. Comparison of algorithms for dissimilaritybased compound selection. J. Mol. Graphics Modell. 1997, 15, 372-385.
17. Mount, J.; Ruppert, J.; Welch, W.; Jain, A. N. IcePick: A flexible surface-based system for molecular diversity. J. Med. Chem. 1999, 42, 60-66.
18. Sheridan, R. P. The most common chemical replacements in drug-like compounds. J. Chem. Inf. Comput. Sci. 2002, 2, 103-108.
19. Wang, J.; Ramnarayan, K. Toward designing drug-like libraries: a novel computational approach for prediction of important structural features. J. Comb. Chem. 1999, 1, 52-533.
20. Waldman, M.; Li, H.; Hassan, M. Novel algorithms for the optimization od molecular diversity of combinatorial libraries. J. Mol. Graphics Modell. 2000, 18, 412-426.
21. Good, A. C.; Lewis, R. A. New methodology for profiling combinatorial libraries and screening sets: cleaning up the design process with HARPcik. J. Med. Chem. 1997, 40, 3226-3236.
22. Agrafiotis, D. K. Stochastic Algorithms for maximizing molecular diversity. J. Chem. Inf. Comput. Sci. 1997, 37, 841-851.
23. Agrafiotis, D. Multiobjective Optimization of Combinatorial Libraries. IBM J. Res. Dev. 2001, 45, 545-566.
24. Sheridan, R. P.; San Feliciano, S. G.; Kearsley, S. K. Designing targeted libraries with Genetic Algorithms. J. Mol. Graphics Modell. 2000, 18, 320-333.
25. Brown, R. D.; Martin, Y. C. Designing combinatorial library mixtures using Genetic Algorithms. J. Med. Chem. 1997, 40, 2304-2313.
26. Rose, K. Deterministic Annealing for Clustering, Compression, Classification, Regression and Related Optimization Problems. Proc. IEEE 1998, 86, 2210-39.
27. Rose, K. Constrained Clustering as an Optimization Method. IEEE Trans. Pattern Anal. Machine Intell. 1993, 15, 785-794.
28. Kirkpatrick, S.; Gelatt, C.; Vechhi, M. Optimization by Simulated Annealing. Science 1983, 220, 671-680.
29. Agrafiotis, D. K.; Lobanov, V. S.; Salemme, F. R. Combinatorial Informatics in the postgenomics era. Nat. Rev. 2002, 1, 337-346.
30. Gordon, E.; Barrett, R.; Dower, W.; Fodor, S.; Gallop, M. Applications of Combinatorial Technologies to Drug Discovery. 2. Combinatorial Organic Synthesis, Library Screening Strategies, and Future Directions. J. Med. Chem. 1994, 37, 1385-1401.
31. Clark, R. D. OptiSim: An Extended Dissimilarity Selection Method for Finding Diverse Representative Subsets. J. Chem. Inf. Comput. Sci. 1997, 37, 1181-1188.
32. Agrafiotis, D.; Lobanov, V. S. Ultrafast Algorithm for Designing Focussed Combinatorial Arrays. J. Chem. Inf. Comput. Sci. 2000, 40, 1030-1038.
33. Livingston, D. J. The characterization of molecular structures using molecular properties: A survey. J. Chem. Inf. Comput. Sci. 2000, 40, 195-209.
34. Schlkopf, B.; Smola, A. J.; Mller, K.-R. Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput. 1998, 10, 1299-1319.
35. Jolliffe, I. T. Principal Component Analysis; Springer-Verlag: New York, 2002; Springer Series in Statistics.
36. Lloyd, S. Least squares quantization in PCM. IEEE Trans. Inf. Theory 1982, 28, 129-137.
37. Berger, T. Rate Distortion Theory: A Mathematical Basis for Data Compression; Prentice Hall: Englewood Cliffs, NJ, 1971.
38. Lin, S. K. Molecular Diversity Assesment: logarithmic relations of information and species diversity and logarithmic relations of entropy and indistinguishability after rejection of Gibbs paradox of entropy mixing. Molecules 1996, 1, 57-67.
39. Shannon, C. E.; Weaver, W. The mathematical theory of communication; University of Illinois Press: Urbana, Illinois, 1949.
40. Rose, K. Statistical mechanics and phase transitions in clustering. Phys. Rev. Lett. 1990, 65, 945-948.
41. MacQueen, J. B. Some Methods for Classification and Analysis of Multivariate Observations. In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability; University of California Press: Berkeley, CA, 1967.
42. Lynch, M.; Mosher, C.; Huff, J.; Nettikadan, S.; Johnson, J.; Henderson, E. Functional protein nanoarrays for biomarker profiling. Proteomics 2004, 4, 1695-702.
43. Fiedler, M. Algebraic connectivity of graphs. Czech. Math. J. 1973, 23, 298-305.
44. Fiedler, M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 1975, 25, 619-633.
45. Hendrickson, B.; Leland, M. Multidimensional Spectral Load Balancing; Sandia National Laboratories: Albuquerque, NM, 1993.
46. Shi, J.; Malik, J. Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Anal. Machine Intell. 2000, 22, 888-905.
47. Sharma, P.; Salapaka, S.; Beck, C. A Deterministic Annealing Approach to Combinatorial Library Design for Drug Discovery. In Proceedings of the American Control Conference; IEEE: Los Alamitos, CA, 2005.
48. McMaster HTS Lab Competition. HTS Data Mining and Docking Competition. http://hts.mcmaster.ca/Downloads/82BFBEB4-F2A4-4934-B6A8-804CAD8E25A0.html (accessed June 2006).
49. Guha, R. Chemistry Development Kit (CDK) Descriptor Calculator GUI (v. 0.46). http://cheminfo.informatics.indiana.edu/rguha/code/java/cdkdesc.html (accessed October 2006).
50. Steinbeck, C.; Hoppe, C.; Kuhn, S.; Floris, M.; Guha, R.; Willighagen, E. L. Recent Developments of the Chemistry Development Kit (CDK) - An Open-Source JAVA Library for Chemo and Bioinformatics. Curr. Pharm. Des. 2006, 12, 2110-2120.
51. Patterson, D. E.; Cramer, R. D.; Ferguson, A. M.; Clark, R. D.; Weinberger, L. E. Neighborhood Behavior: A Useful Concept for Validation of "Molecular Diversity" Descriptors. J. Med. Chem. 1996, 39, 3049-3059.
52. Jaynes, E. T. Information Theory and Statistical Mechanics. Phys. Rev. 1957, 106, 620-630.
53. Jaynes, E. T. Information Theory and Statistical Mechanics II. Phys. Rev. 1957, 108, 171-190.