Combinatorial library design for diversity, cost efficiency, and drug-like character.

Most computational techniques for the design of combinatorial libraries have concentrated solely on maximizing the diversity of the selected subset or its similarity to a known target. However, such libraries can produce high-throughput screening hits with properties that make them unsuitable to take forward into medicinal chemistry. This article describes software that allows the design of library subsets to simultaneously optimize a library's diversity or similarity to a target, properties (such as drug likeness) of the library members, properties (such as cost) of the reagents required to make them, and efficiency of synthesis in arrays or mixtures. Example are given showing that libraries can be designed to contain drug-like molecules with only a small trade-off in terms of the maximum possible diversity, and that the cost of the library, in terms of the reagents required to make it, can be contained. Other examples show that libraries can be designed to minimize the deconvolution problem or to maximize the number of molecules predicted to be active while also being designed for efficiency of synthesis.

[1]  Marvin Waldman,et al.  Evaluation of Reagent-Based and Product-Based Strategies in the Design of Combinatorial Library Subsets , 2000, J. Chem. Inf. Comput. Sci..

[2]  Y. Martin,et al.  Designing combinatorial library mixtures using a genetic algorithm. , 1997, Journal of medicinal chemistry.

[3]  Tudor I. Oprea,et al.  The Design of Leadlike Combinatorial Libraries. , 1999, Angewandte Chemie.

[4]  Y. Martin,et al.  Computational methods in molecular diversity and combinatorial chemistry. , 1998, Current opinion in chemical biology.

[5]  F. Lombardo,et al.  Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. , 2001, Advanced drug delivery reviews.

[6]  I. Ugi,et al.  The Passerini and Ugi Reactions , 1991 .

[7]  David E. Clark,et al.  Evolutionary algorithms in computer-aided molecular design , 1996, J. Comput. Aided Mol. Des..

[8]  A. Balaban Highly discriminating distance-based topological index , 1982 .

[9]  R. Brown,et al.  Genetic diversity: applications of evolutionary algorithms to combinatorial library design , 1998 .

[10]  John Bradshaw,et al.  The Effectiveness of Reactant Pools for Generating Structurally-Diverse Combinatorial Libraries , 1997, J. Chem. Inf. Comput. Sci..

[11]  John Bradshaw,et al.  Identification of Biological Activity Profiles Using Substructural Analysis and Genetic Algorithms , 1998, J. Chem. Inf. Comput. Sci..

[12]  Peter Willett,et al.  Computational methods for the analysis of molecular diversity , 1996 .

[13]  Danail Bonchev,et al.  Information theoretic indices for characterization of chemical structures , 1983 .

[14]  M Waldman,et al.  Novel algorithms for the optimization of molecular diversity of combinatorial libraries. , 2000, Journal of molecular graphics & modelling.

[15]  A. Ghose,et al.  Prediction of Hydrophobic (Lipophilic) Properties of Small Organic Molecules Using Fragmental Methods: An Analysis of ALOGP and CLOGP Methods , 1998 .

[16]  J M Blaney,et al.  Computational approaches for combinatorial library design and molecular diversity analysis. , 1997, Current opinion in chemical biology.

[17]  Nenad Trinajstić,et al.  An algorithm for construction of the molecular distance matrix , 1987 .