Faster and Space-Optimal Edit Distance “1” Dictionary

DOI10.1007/978-3-642-02441-2_14zbMath1247.68065OpenAlexW1545097943MaRDI QIDQ3637110

Djamal Belazzougui

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_14

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Algorithms on strings (68W32)

Related Items (7)

Compressed string dictionary search with edit distance one ⋮ Fast String Dictionary Lookup with One Error ⋮ Simple, compact and robust approximate string dictionary ⋮ Unnamed Item ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ String indexing for patterns with wildcards ⋮ Index structures for fast similarity search for symbol strings

Cites Work

• Unnamed Item
• Improved bounds for dictionary look-up with one error
• Representing trees of higher degree
• Advanced Data Structures
• Dictionary matching and indexing with errors and don't cares
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Efficient Storage and Retrieval by Content and Address of Static Files
• Combinatorial Pattern Matching

This page was built for publication: Faster and Space-Optimal Edit Distance “1” Dictionary