Searching for Recursively Defined Generic Chemical Patterns in Nonenumerated Fragment Spaces

Abstract

Retrieving molecules with specific structural features is a fundamental requirement of today's molecular database technologies. Estimates claim the chemical space relevant for drug discovery to be around 10⁶⁰ molecules. This figure is many orders of magnitude larger than the amount of molecules conventional databases retain today and will store in the future. An elegant description of such a large chemical space is provided by the concept of fragment spaces. A fragment space comprises fragments that are molecules with open valences and describes rules how to connect these fragments to products. Due to the combinatorial nature of fragment spaces, a complete enumeration of its products is intractable. We present an algorithm to search fragment spaces for generic chemical patterns as present in the SMARTS chemical pattern language. Our method allows specification of the chemical surrounding of an atom in a query and, therefore, enables a chemically intuitive search. During the search, the costly enumeration of products is avoided. The result is a fragment space that exactly describes all possible molecules that contain the user-defined pattern. We evaluated the algorithm in three different drug development use-cases and performed a large scale statistical analysis with 738 SMARTS patterns on three public available fragment spaces. Our results show the ability of the algorithm to explore the chemical space around known active molecules, to analyze fragment spaces for the presence of likely toxic molecules, and to identify complex macromolecular structures under additional structural constraints. By searching the fragment space in its nonenumerated form, spaces covering up to 10¹⁹ molecules can be examined in times ranging between 47 s and 19 min depending on the complexity of the query pattern.

Conformator: A Novel Method for the Generation of Conformer Ensembles

“…Once all possible torsion angles have been assigned based on this SMARTS pattern matching procedure, individual torsion angle values are removed during an iterative process until the maximum number of possible conformers (based on the combination of all assigned torsion angles, neglecting potential clashes) no longer exceeds the maximum number of generated candidate conformers for clustering. The number of torsion angles assigned to a rotatable bond depends on the bond’s centricity in the molecule, the overall flexibility of the molecule, and the sampling parameters defined by the user (such as the maximum ensemble size).…”

Intelligent pharmaceutical patent search on a near-term gate-based quantum computer

“…Simple combinations of scaffolds and R group member lists quickly lead to large numbers of structures 20 . Current chemical patent databases do not actually store all the compounds in the claims since the compound set in a patent is too large, which makes the solution infeasible 21 .…”

What Is High-Throughput Virtual Screening? A Perspective from Organic Materials Discovery

“…Given the intrinsic impossibility of enumerating all the molecules in all but the smallest sections of molecular space, much effort is being put into methods to avoid explicit enumeration in high throughput screening, with approaches such as optimizing potentials to make a rugged region of chemical space flatter, (5) alchemical transformation on a given backbone (6), generating aromatic rings that electronically equivalent to a reference; (7) stochastic generation of derivatives; (8), recursive substructure searches (9) or morphing of starting molecules of interest. (10) However, more often than not, high-throughput-screening projects rely on explicitly enumerated libraries.…”