paper-with-me

Papers

SPECTRe: Substructure Processing, Enumeration, and Comparison Tool Resource: An efficient tool to encode all substructures of molecules represented in SMILES

2021-11-05 · Yasemin Yesiltepe, Ryan S. Renslow, Thomas O. Metz

Functional groups and moieties are chemical descriptors of biomolecules that can be used to interpret their properties and functions, leading to the understanding of chemical or biological mechanisms. These chemical building blocks, or sub-structures, enable the identification of common molecular subgroups, assessing the structural similarities and critical interactions among a set of biological molecules with known activities, and designing novel compounds with similar chemical properties. Here, we introduce a Python-based tool, SPECTRe (Substructure Processing, Enumeration, and Comparison Tool Resource), designed to provide all substructures in a given molecular structure, regardless of the molecule size, employing efficient enumeration and generation of substructures represented in a human-readable SMILES format through the use of classical graph traversal (breadth-first and depth-first search) algorithms. We demonstrate the application of SPECTRe for a set of 10,375 molecules in the molecular weight range 27 to 350 Da (<=26 non-hydrogen atoms), spanning a wide array of structure-based chemical functionalities and chemical classes. We found that the substructure count as a measure of molecular complexity depends strongly on the number of unique atom and bond types present, degree of branching, and presence of rings. The substructure counts are found to be similar for a set of molecules belonging to particular chemical classes and classified based on the characteristic features of certain topologies. We demonstrate that SPECTRe shows promise to be useful in many applications of cheminformatics such as virtual screening for drug discovery, property prediction, fingerprint-based molecular similarity searching, and data mining for identifying frequent substructures.

📄 PDF Abstract BibTeX arXiv:2111.03227

Code (0)

등록된 구현이 없습니다.

Tasks

AllDrug DiscoveryProperty Prediction

Similar Papers 제목 키워드 기반

FastSpec: Scalable Generation and Detection of Spectre Gadgets Using Neural Embeddings

2020-06-25 · M. Caner Tol, Berk Gulmezoglu, Koray Yurtseven, Berk Sunar

Several techniques have been proposed to detect vulnerable Spectre gadgets in widely deployed commercial software. Unfortunately, detection techniques proposed so far rely on hand-written rules which fall short in coveri…

Code Generation

Beam Enumeration: Probabilistic Explainability For Sample Efficient Self-conditioned Molecular Design

2023-09-25 · Jeff Guo, Philippe Schwaller

Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficie…

SPECTRE: An FFT-Based Efficient Drop-In Replacement to Self-Attention for Long Contexts

2025-02-25 · Jacob Fein-Ashley, Neelesh Gupta, Rajgopal Kannan, Viktor Prasanna

Long-context transformers face significant efficiency challenges due to the quadratic cost of self-attention. However, many modern applications-from multi-turn dialogue to high-resolution vision-require contexts spanning…

Language ModelingLanguage Modelling

Short Paper: Static and Microarchitectural ML-Based Approaches For Detecting Spectre Vulnerabilities and Attacks

2022-10-26 · Chidera Biringa, Gaspard Baye, Gökhan Kul

Spectre intrusions exploit speculative execution design vulnerabilities in modern processors. The attacks violate the principles of isolation in programs to gain unauthorized private user information. Current state-of-th…

Detection of Common Subtrees with Identical Label Distribution

2023-07-24 · Romain Azaïs, Florian Ingels

Frequent pattern mining is a relevant method to analyse structured data, like sequences, trees or graphs. It consists in identifying characteristic substructures of a dataset. This paper deals with a new type of patterns…