We present an efficient algorithm for substructure search
in combinatorial
libraries defined by synthons, i.e., substructures with connection
points. Our method improves on existing approaches by introducing
powerful heuristics and fast fingerprint screening to quickly eliminate
branches of nonmatching combinations of synthons. With this, we achieve
typical response times of a few seconds on a standard desktop computer
for searches in large combinatorial libraries like the Enamine REAL
Space. We published the Java source as part of the OpenChemLib under
the BSD license, and we implemented tools to enable substructure search
in custom combinatorial libraries.
We present an efficient algorithm for substructure search in combinatorial libraries defined by synthons, i.e. substructures with connection points. Our method improves on existing approaches by introducing powerful heuristics and fast fingerprint screening to quickly eliminate branches of non matching combinations of synthons. With this we achieve typical response times of a few seconds on a standard desktop computer for searches in large combinatorial libraries like the Enamine REAL space. We published the Java source as part of the OpenChemLib under the BSD license, and we implemented tools to enable substructure search in custom combinatorial libraries.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.