Scalable Similarity Search For Molecular Descriptors

Abstract

Similarity search over chemical compound databases is a fundamental task in the discovery and design of novel drug-like molecules. Such databases often encode molecules as non-negative integer vectors, called molecular descriptors, which represent rich information on various molecular properties. While there exist efficient indexing structures for searching databases of binary vectors, solutions for more general integer vectors are in their infancy. In this paper we present a time- and space- efficient index for the problem that we call the succinct intervals-splitting tree algorithm for molecular descriptors (SITAd). Our approach extends efficient methods for binary-vector databases, and uses ideas from succinct data structures. Our experiments, on a large database of over 40 million compounds, show SITAd significantly outperforms alternative approaches in practice.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keytabei2016scalable

Related papers

• Utilizing Low-dimensional Molecular Embeddings For Rapid Chemical Similarity Search (2024)4.52
• Fpscreen: A Rapid Similarity Search Tool For Massive Molecular Library Based On Molecular Fingerprint Comparison (2019)0.00
• Dumpyos: A Data-adaptive Multi-ary Index For Scalable Data Series Similarity Search (2024)5.24
• Improving Similarity Search With High-dimensional Locality-sensitive Hashing (2018)0.00
• Interleaved Composite Quantization For High-dimensional Similarity Search (2019)0.00
• Efficient Similarity Search In Dynamic Data Streams (2016)0.00
• Subsets And Supermajorities: Optimal Hashing-based Set Similarity Search (2019)5.84
• Learned Indexing In Proteins: Extended Work On Substituting Complex Distance Calculations With Embedding And Clustering Techniques (2022)5.84