Improved bounds for dictionary look-up with one error
From MaRDI portal
Publication:294796
DOI10.1016/S0020-0190(00)00079-XzbMath1339.68050OpenAlexW2161245503MaRDI QIDQ294796
F. Blanchet-Sadri, M. Dambrine
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000079X?np=y
Related Items (9)
Compressed string dictionary search with edit distance one ⋮ Fast String Dictionary Lookup with One Error ⋮ Unnamed Item ⋮ Text indexing with errors ⋮ DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE ⋮ Index structures for fast similarity search for binary vectors ⋮ Difference Covers ⋮ Faster and Space-Optimal Edit Distance “1” Dictionary ⋮ A Survey of Data Structures in the Bitprobe Model
Cites Work
- Unnamed Item
- Unnamed Item
- Two results on tables
- An algorithm for approximate membership checking with application to password security
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Should Tables Be Sorted?
- Dictionary Look-Up with One Error
- Universal hashing and k-wise independent random variables via integer arithmetic without primes
This page was built for publication: Improved bounds for dictionary look-up with one error
