Virtual combinatorial library product-based design

Product-based selection is much more computationally demanding than reagent-based selection. Typically, it requires the computational enumeration of the full virtual combinatorial library and calculation of the descriptors for all possible products, prior to the application of a subset selection method. Consider a three-component reaction with 100 reagents available at each substituent position and assume that the aim is to build a 10 x 10 x 10 combinatorial library. In reagent-based selection, this requires the calculation of descriptors for 300 compounds (100 + 100 + 100). In product-based design, however, the full library of 1 million compounds (100 x 100 x 100) must be enumerated and descriptors must be calculated for each product molecule. 

The size of a virtual library can be reduced by applying filters to eliminate reagents that are known to be undesirable [67]. However, in some cases, the virtual library may still be too large to allow full enumeration, and thus full product-based design is infeasible. (Although the need for full enumeration may not be necessary in the future, for example, Barnard et al. [82] have recently developed a method for the rapid calculation of descriptors for the products in a virtual combinatorial library that avoids the need for enumeration.)... 

The chapter begins with a discussion of similarity and diversity measures and how they can be applied in a virtual screening context. The various computational filters in use are also discussed. The rest of the chapter is concerned with different approaches to combinatorial library design, beginning with reagent-based methods followed by product-based approaches of cherry picking and combinatorial subset selection. Finally, approaches to designing libraries optimized on multiple properties simultaneously are discussed. 

---