de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Chemical library subset selection algorithms: A unified derivation using spatial statistics

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons59045

Thiel,  W.
Research Department Thiel, Max-Planck-Institut für Kohlenforschung, Max Planck Society;
Research Department Thiel, Max-Planck-Institut für Kohlenforschung, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Hamprecht, F. A., Thiel, W., & van Gunsteren, W. F. (2002). Chemical library subset selection algorithms: A unified derivation using spatial statistics. Journal of Chemical Information and Computer Sciences, 42(2), 414-428. doi:10.1021/ci010376b.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-9A07-5
Abstract
If similar compounds have similar activity, rational subset selection becomes superior to random selection in screening for pharmacological lead discovery programs. Traditional approaches to this experimental design problem fall into two classes: (i) a linear or quadratic response function is assumed (ii) some space filling criterion is optimized. The assumptions underlying the first approach are clear but not always defendable; the second approach yields more intuitive designs but lacks a clear theoretical foundation. We model activity in a bioassay as realization of a stochastic process and use the best linear unbiased estimator to construct spatial sampling designs that optimize the integrated mean square prediction error, the maximum mean square prediction error, or the entropy. We argue that our approach constitutes a unifying framework encompassing most proposed techniques as limiting cases and sheds light on their underlying assumptions. In particular, vector quantization is obtained, in dimensions up to eight, in the limiting case of very smooth response surfaces for the integrated mean square error criterion. Closest packing is obtained for very rough surfaces under the integrated mean square error and entropy criteria. We suggest to use either the integrated mean square prediction error or the entropy as optimization criteria rather than approximations thereof and propose a scheme for direct iterative minimization of the integrated mean square prediction error. Finally, we discuss how the quality of chemical descriptors manifests itself and clarify the assumptions underlying the selection of diverse or representative subsets.