|
Searching fragment spaces with Feature Trees
Uta Lessel and Bernd Wellenzohn
Virtual combinatorial chemistry easily produces billions of compounds, which can not be screened in a conventional manner even with the fastest methods available. An efficient solution for such a scenario is the generation of fragment spaces which encode huge numbers of virtual compounds by their fragments/reagents and rules of how to combine them. Fragment spaces can be screened with so-called fragment space searches using e.g. the Feature Tree descriptor.
This is frequently used for virtual screening and has a potential for scaffold hopping. The fragment space searches are performed without ever fully enumerating all virtual products.
In this presentation we show the preparation of fragment spaces based on combinatorial chemistry and share our experiences with fragment space searches based on the Feature Tree descriptor in a possible workflow to use this methodology in a pharmaceutical setup.
|