Premium
Genetic optimization of combinatorial libraries
Author(s) -
Gobbi Alberto,
Poppinger Dieter
Publication year - 1998
Publication title -
biotechnology and bioengineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.136
H-Index - 189
eISSN - 1097-0290
pISSN - 0006-3592
DOI - 10.1002/(sici)1097-0290(199824)61:1<47::aid-bit9>3.0.co;2-z
Subject(s) - combinatorial optimization , computational biology , biology , microbiology and biotechnology , biochemical engineering , computer science , mathematics , mathematical optimization , engineering
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 10 12 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.