2009
DOI: 10.1021/ci800272a
|View full text |Cite
|
Sign up to set email alerts
|

Searching Fragment Spaces with Feature Trees

Abstract: Virtual combinatorial chemistry easily produces billions of compounds, for which conventional virtual screening cannot be performed 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. Similarity-based searches can be performed in such spaces without ever fully enumerating all virtual products. Here we describe the generation of a huge … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
71
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 85 publications
(72 citation statements)
references
References 26 publications
(28 reference statements)
1
71
0
Order By: Relevance
“…It is impractical to explicitly enumerate all these compounds and to search them, so methods have been developed to narrow down the search space, based on representing the molecules as combinations of feature trees. Lessel et al [33] have described further improvements to the Colibri approach. This universe can be searched very quickly using feature trees, and in a retrospective study, some known hits could be retrieved from a universe of 10 11 compounds with only 4 query structures as input.…”
Section: Discussionmentioning
confidence: 99%
“…It is impractical to explicitly enumerate all these compounds and to search them, so methods have been developed to narrow down the search space, based on representing the molecules as combinations of feature trees. Lessel et al [33] have described further improvements to the Colibri approach. This universe can be searched very quickly using feature trees, and in a retrospective study, some known hits could be retrieved from a universe of 10 11 compounds with only 4 query structures as input.…”
Section: Discussionmentioning
confidence: 99%
“…The system has subsequently been applied using the Boehringer Ingelheim scaffold and approved reagent list (1600 scaffolds and 30 000 reagents, respectively) to generate a potential library of 5 Â 10 11 unique molecules, called BI CLAIM (Boehringer Ingelheim Comprehensive Library of Accessible Innovative Molecules) [15]. The system used the CoLibri software developed by BioSolveIT to encode the reaction schemes.…”
Section: Similarity Searching In Large Combinatorial Chemistry Spacesmentioning
confidence: 99%
“…The libraries are represented by building block databases and overall summary chemical reactions describing how the building blocks are combined to the final products. The search procedure matches first the building blocks and then checks whether they can be combined into a final molecule with one of the synthesis protocols 90,91. By overlay and alignment of several reduced graphs of known actives, a 2D query model for a set of known ligands can be generated, which can then be used for further queries 92,93…”
Section: Fragment Matching and Reduced Graphsmentioning
confidence: 99%