Searching Fragment Spaces with feature trees.

Virtual combinatorial chemistry easily produces billions of compounds, for which conventional virtual screening cannot be performed even with the fastest methods available. An efficient solution for such a scenario is the generation of Fragment Spaces, which encode huge numbers of virtual compounds by their fragments/reagents and rules of how to combine them. Similarity-based searches can be performed in such spaces without ever fully enumerating all virtual products. Here we describe the generation of a huge Fragment Space encoding about 5 * 10(11) compounds based on established in-house synthesis protocols for combinatorial libraries, i.e., we encode practically evaluated combinatorial chemistry protocols in a machine readable form, rendering them accessible to in silico search methods. We show how such searches in this Fragment Space can be integrated as a first step in an overall workflow. It reduces the extremely huge number of virtual products by several orders of magnitude so that the resulting list of molecules becomes more manageable for further more elaborated and time-consuming analysis steps. Results of a case study are presented and discussed, which lead to some general conclusions for an efficient expansion of the chemical space to be screened in pharmaceutical companies.

Ultrafast de novo docking combining pharmacophores and combinatorics.

We report on a successful de novo design approach which relies on the combination of multi-million compound combinatorial docking under receptor-based pharmacophore constraints. Inspired by a rationale by A.R. Leach et al., we document on the unification of two steps into one for ligand assembly. In the original work, fragments known to bind in protein active sites were connected forming novel ligand compounds by means of generic skeleton linkers and following a combinatorial approach. In our approach, the knowledge of fragments binding to the protein has been expressed in terms of a receptor-based pharmacophore definition. The combinatorial linking step is performed in situ during docking, starting from combinatorial libraries. Three sample scenarios growing in size and complexity (combinatorial libraries of 1 million, 1.3 million, and 22.4 million compounds) have been created to illustrate the method. Docking could be accomplished between minutes and several hours depending on the outset; the results were throughout promising. Technically, a module compatibility between FlexX(C) and FlexX-Pharm has been established. The background is explained, and the crucial points from an information scientist's perspective are highlighted.