Simple, compact and robust approximate string dictionary

DOI10.1016/J.JDA.2014.08.003zbMath1305.68380arXiv1312.4678OpenAlexW2044001676MaRDI QIDQ405575

Ibrahim Chegrane, Djamal Belazzougui

Publication date: 5 September 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4678

zbMATH Keywords

approximate string matchinghashingedit distancedictionary indexing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (2)

Index structures for fast similarity search for binary vectors ⋮ Index structures for fast similarity search for symbol strings

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for approximate membership checking with application to password security
• Compressed String Dictionary Look-Up with Edit Distance One
• Dictionary matching and indexing with errors and don't cares
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Efficient randomized pattern-matching algorithms
• Partial-Match Retrieval Algorithms
• The Power of Simple Tabulation Hashing
• Indexing methods for approximate dictionary searching

This page was built for publication: Simple, compact and robust approximate string dictionary