Exploring fragment spaces under multiple physicochemical constraints

We present a new algorithm for the enumeration of chemical fragment spaces under constraints. Fragment spaces consist of a set of molecular fragments and a set of rules that specifies how fragments can be combined. Although fragment spaces typically cover an infinite number of molecules, they can be enumerated in case that a physicochemical profile of the requested compounds is given. By using min–max ranges for a number of corresponding properties, our algorithm is able to enumerate all molecules which obey these properties. To speed up the calculation, the given ranges are used directly during the build-up process to guide the selection of fragments. Furthermore, a topology based fragment filter is used to skip most of the redundant fragment combinations. We applied the algorithm to 40 different target classes. For each of these, we generated tailored fragment spaces from sets of known inhibitors and additionally derived ranges for several physicochemical properties. We characterized the target-specific fragment spaces and were able to enumerate the complete chemical subspaces for most of the targets.

[1]  A. Hopkins,et al.  Navigating chemical space for biology and medicine , 2004, Nature.

[2]  F. Lombardo,et al.  Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. , 2001, Advanced drug delivery reviews.

[3]  J. Gasteiger,et al.  Automatic generation of 3D-atomic coordinates for organic molecules , 1990 .

[4]  Tudor I. Oprea,et al.  Chemography: the Art of Navigating in Chemical Space , 2000 .

[5]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[6]  Michael M. Hann,et al.  RECAP-Retrosynthetic Combinatorial Analysis Procedure: A Powerful New Technique for Identifying Privileged Molecular Fragments with Useful Applications in Combinatorial Chemistry , 1998, J. Chem. Inf. Comput. Sci..

[7]  Gordon M. Crippen,et al.  Prediction of Physicochemical Parameters by Atomic Contributions , 1999, J. Chem. Inf. Comput. Sci..

[8]  M Rarey,et al.  Detailed analysis of scoring functions for virtual screening. , 2001, Journal of medicinal chemistry.

[9]  Thomas Lengauer Bioinformatics : from genomes to therapies , 2007 .

[10]  L. Weber Current Status of Virtual Combinatorial Library Design , 2005 .

[11]  J. Irwin,et al.  Benchmarking sets for molecular docking. , 2006, Journal of medicinal chemistry.

[12]  Thomas Lengauer,et al.  A fast flexible docking method using an incremental construction algorithm. , 1996, Journal of molecular biology.

[13]  Matthias Rarey,et al.  FlexNovo: Structure‐Based Searching in Large Fragment Spaces , 2006, ChemMedChem.

[14]  David Weininger,et al.  SMILES. 2. Algorithm for generation of unique SMILES notation , 1989, J. Chem. Inf. Comput. Sci..

[15]  Petra Schneider,et al.  De novo design of molecular architectures by evolutionary assembly of drug-derived building blocks , 2000, J. Comput. Aided Mol. Des..

[16]  Matthias Rarey,et al.  Feature trees: A new molecular similarity measure based on tree matching , 1998, J. Comput. Aided Mol. Des..

[17]  Matthias Rarey,et al.  Similarity searching in large combinatorial chemistry spaces , 2001, J. Comput. Aided Mol. Des..

[18]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[19]  C. Dobson Chemical space and biology , 2004, Nature.

[20]  Matthias Rarey,et al.  Automated Drawing of Structural Molecular Formulas under Constraints , 2004, J. Chem. Inf. Model..

[21]  Gisbert Schneider,et al.  Computer-based de novo design of drug-like molecules , 2005, Nature Reviews Drug Discovery.

[22]  Matthias Rarey,et al.  Docking and Scoring for Structure‐based Drug Design , 2008 .