Genetic optimization of combinatorial libraries
- 1 January 1998
- journal article
- computational
- Published by Wiley in Biotechnology & Bioengineering
- Vol. 61 (1) , 47-54
- https://doi.org/10.1002/(sici)1097-0290(199824)61:1<47::aid-bit9>3.0.co;2-z
Abstract
Most agrochemical and pharmaceutical companies have set up high‐throughput screening programs which require large numbers of compounds to screen. Combinatorial libraries provide an attractive way to deliver these compounds. A single combinatorial library with four variable positions can yield more than 1012 potential compounds, if one assumes that about 1000 reagents are available for each position. This is far more than any high‐throughput screening facility can afford to screen. We have proposed a method for iterative compound selection from large databases, which identifies the most active compounds by examining only a small fraction of the database. In this article, we describe the extension of this method to the problem of selecting compounds from large combinatorial libraries. © 1998 John Wiley & Sons, Inc. Biotechnol Bioeng (Comb Chem) 61:47–54, 1998.Keywords
This publication has 4 references indexed in Scilit:
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1996
- Application of Genetic Algorithms to Combinatorial Synthesis: A Computational Approach to Lead Identification and Lead Optimization,Journal of the American Chemical Society, 1996
- Optimierung der biologischen Aktivität von kombinatorischen Verbindungsbibliotheken durch einen genetischen AlgorithmusAngewandte Chemie, 1995
- A genetic algorithm for the automated generation of molecules within constraintsJournal of Computer-Aided Molecular Design, 1995