Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10822-007-9121-3 | Journal of computer-aided molecular design |
Keywords | Field | DocType |
Chemical fragment spaces,Enumeration,De novo design,Library design,Ligand-based design,Computer chemistry | Combinatorics,Computational chemistry,Enumeration,Chemistry,Linear subspace,Speedup | Journal |
Volume | Issue | ISSN |
21 | 6 | 0920-654X |
Citations | PageRank | References |
1 | 0.39 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juri Pärn | 1 | 6 | 0.80 |
| Jörg Degen | 2 | 6 | 1.13 |
| Matthias Rarey | 3 | 472 | 76.58 |