Efficient algorithms for substring near neighbor problem
From MaRDI portal
Publication:3581521
DOI10.1145/1109557.1109690zbMath1192.68814MaRDI QIDQ3581521
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
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
92D20: Protein sequences, DNA sequences
Related Items
Unnamed Item, Unnamed Item, Learning Binary Hash Codes for Large-Scale Image Search, The Distortion of Locality Sensitive Hashing, Unnamed Item, Unnamed Item, Lattice-based locality sensitive hashing is optimal, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, Unnamed Item, A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data, Fingerprints in compressed strings, Longest common substring with approximately \(k\) mismatches, Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny), Approximating Spectral Clustering via Sampling: A Review