Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Virtual combinatorial library reagent-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. [Pg.628]

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.)... [Pg.628]

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. [Pg.618]

The nature of combinatorial chemistry can present a considerable challenge because these libraries are generally produced as arrays of compounds and it is often inconvenient to synthesize individual compounds in order to achieve an optimal design. Two methods have been described that attempt to select optimal subset of reagents from a virtual library that has been partitioned into favorable and unfavorable compounds by some method of filtering. The PLUMS algorithm [97] was designed to simultaneously optimize the size of the library based on effectiveness and efEciency . [Pg.185]


See other pages where Virtual combinatorial library reagent-based design is mentioned: [Pg.236]    [Pg.195]    [Pg.155]    [Pg.629]    [Pg.23]    [Pg.270]    [Pg.268]    [Pg.297]    [Pg.397]    [Pg.178]    [Pg.288]    [Pg.309]    [Pg.364]    [Pg.111]    [Pg.112]    [Pg.112]    [Pg.175]    [Pg.56]    [Pg.272]    [Pg.630]    [Pg.634]    [Pg.381]    [Pg.31]    [Pg.315]    [Pg.343]    [Pg.270]    [Pg.335]   
See also in sourсe #XX -- [ Pg.278 ]




SEARCH



Based Reagents

Combinatorial design

Combinatorial library

Combinatorial virtual

Design Bases

Design based library

Design reagent-based

Designing Combinatorial Libraries

Libraries, combinatorial design

Library design

Reagent-based library design

Virtual combinatorial library

Virtual combinatorial library libraries

Virtual library design

© 2024 chempedia.info