AI summary · arXiv: 2402.07970v1 · cs.IR

Utilizing Low-Dimensional Molecular Embeddings for Rapid Chemical Similarity Search

Kathryn E. Kirchoff, James Wellnitz, Joshua E. Hochuli, Travis Maxfield, Konstantin I. Popov, Shawn Gomez, Alexander Tropsha

Original paper · DOI Submitted to arXiv on 12 Feb. 2024 License: CC BY 4.0

The essentials

  • Nearest neighbor-based similarity searching in chemistry is crucial for applications like drug discovery.
  • Traditional brute-force methods for this task can be computationally expensive and time-consuming due to the size of chemical databases.
  • Combining low-dimensional chemical embeddings with a k-d tree data structure can achieve rapid nearest neighbor queries while maintaining high performance on standard benchmarks.
  • SmallSA, a learned embedding generated using the SALSA framework trained on 1.4 million chemical compounds, significantly accelerates searches on large databases, executing queries on over one billion chemicals in less than a second on a single CPU core – five orders of magnitude faster than brute-force methods.
  • SmallSA achieves competitive performance on standard chemical similarity benchmarks compared to traditional fingerprinting methods like ECFPs and ECFCs, highlighting the potential of leveraging low-dimensional embeddings and k-d trees for efficient chemical similarity searching in drug discovery and other chemistry applications.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: Chemistry

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
, , , , In the field of chemistry, nearest neighbor-based similarity searching is a crucial task, particularly in applications like drug discovery. Traditional approaches to this task often rely on brute-force methods, which can be computationally expensive and time-consuming due to the vast size of modern chemical databases. Previous advancements in computational techniques for this task have been limited in their generalizability and efficiency. In this study, we explore the potential of combining low-dimensional chemical embeddings with a k-d tree data structure to achieve rapid nearest neighbor queries while maintaining high performance on standard chemical similarity benchmarks. Our approach addresses challenges faced by existing tools such as ChemMine and FPSim2, which utilize partitioning schemes based on Baldi bounds but are limited by binary embeddings and unequal partition sizes. To overcome these limitations, we propose SmallSA, a learned embedding generated using the SALSA framework trained on 1.4 million chemical compounds from the Enamine catalog. We compare SmallSA with commonly used Extended-Connectivity Fingerprints (ECFPs) and Extended-Connectivity Count Vectors (ECFCs) as well as their low-dimensional versions. Our results demonstrate that our approach significantly accelerates searches on large chemical databases, executing queries on over one billion chemicals in less than a second on a single CPU core – five orders of magnitude faster than brute-force methods. Furthermore, SmallSA achieves competitive performance on standard chemical similarity benchmarks compared to traditional fingerprinting methods like ECFPs and ECFCs. This highlights the potential of leveraging low-dimensional embeddings and k-d trees for efficient chemical similarity searching in drug discovery and other applications within the field of chemistry.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Slides to present it
For journalists Press kit and hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.