Ultrafast algorithm for designing focused combinational arrays
A novel greedy algorithm for the design of focused combinatorial arrays is presented. The method is applicable when the objective function is decomposable to individual molecular contributions and makes use of a heuristic that allows the independent evaluation and ranking of candidate reagents in each variation site in the combinatorial library. The algorithm is extremely fast and convergent and produces solutions that are comparable to and often better than those derived from the substantially more elaborate and computationally intensive stochastic sampling techniques. Typical examples of design objectives that are amendable to this approach include maximum similarity to a known lead (or set of leads), maximum predicted activity according to some structure-activity or receptor binding model, containment within certain molecular property bounds, and many others.
Agrafiotis
DK
3-Dimensional Pharmaceuticals, Inc., Exton, Pennsylvania 19341, USA. dimitris@3dp.com
Lobanov
VS