Efficient algorithms for substring near neighbor problem

DOI10.1145/1109557.1109690zbMath1192.68814OpenAlexW4243924383MaRDI QIDQ3581521

Alexandr Andoni, Piotr Indyk

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109690

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items (14)

The Distortion of Locality Sensitive Hashing ⋮ Fingerprints in compressed strings ⋮ Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) ⋮ Longest common substring with approximately \(k\) mismatches ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data ⋮ Learning Binary Hash Codes for Large-Scale Image Search ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Efficient algorithms for substring near neighbor problem