Fast String Dictionary Lookup with One Error

DOI10.1007/978-3-319-19929-0_10zbMath1432.68084OpenAlexW804826218MaRDI QIDQ2942250

Timothy M. Chan, Moshe Lewenstein

Publication date: 20 August 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_10

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Unnamed Item ⋮ Index structures for fast similarity search for symbol strings

Cites Work

• Unnamed Item
• Improved bounds for dictionary look-up with one error
• Fast index for approximate string matching
• A linear size index for approximate pattern matching
• On space efficient two dimensional range minimum data structures
• A simple storage scheme for strings achieving entropy bounds
• Improved approximate string matching using compressed suffix data structures
• String indexing for patterns with wildcards
• Multi-method dispatching
• Orthogonal Range Searching for Text Indexing
• Compressed String Dictionary Look-Up with Edit Distance One
• Document Retrieval with One Wildcard
• Hashing and Indexing: Succinct DataStructures and Smoothed Analysis
• Space-Efficient String Indexing for Wildcard Pattern Matching.
• Dictionary matching and indexing with errors and don't cares
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Dictionary Look-Up with One Error
• A linear lower bound on index size for text retrieval
• Text Indexing and Dictionary Matching with One Error
• Dictionary Matching with One Gap
• Orthogonal range searching on the RAM, revisited
• Compressed indexes for approximate string matching

This page was built for publication: Fast String Dictionary Lookup with One Error