Related Experiment Video
Updated: Jul 29, 2025

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
Published on: April 13, 2022
Fast Substructure Search in Combinatorial Library Spaces
Thomas Liphardt1, Thomas Sander1
1Scientific Computing Drug Discovery, Idorsia Pharmaceuticals, Ltd., CH-4123 Allschwil, Switzerland.
Abstract:
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.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Additional Subnuclear Structures
The Aufbau Principle and Hund's Rule
Stability of Substituted Cyclohexanes
The two chair conformations of cyclohexanes undergo rapid interconversion at room temperature. Both forms have identical energies and stabilities, each comprising equal amounts of the equilibrium mixture. Replacing a hydrogen atom with a functional group makes the two conformations energetically non-equivalent.
For example, in...
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Structures of Solids

