Fast string dictionary lookup with one error

DOI10.1007/978-3-319-19929-0_10MaRDI QIDQ2942250zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Fast entropy-bounded string dictionary look-up with mismatches
• scientific article; zbMATH DE number 2185612
• Text Indexing and Dictionary Matching with One Error
• Compressed string dictionary search with edit distance one
• A new method for approximate indexing and dictionary lookup with one error

Cites work

• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A linear lower bound on index size for text retrieval
• A linear size index for approximate pattern matching
• A simple storage scheme for strings achieving entropy bounds
• Compressed indexes for approximate string matching
• Compressed string dictionary look-up with edit distance one
• Dictionary Look-Up with One Error
• Dictionary matching and indexing with errors and don't cares
• Dictionary matching with one gap
• Document retrieval with one wildcard
• Fast index for approximate string matching
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Hashing and indexing: succinct data structures and smoothed analysis
• Improved approximate string matching using compressed suffix data structures
• Improved bounds for dictionary look-up with one error
• Multi-method dispatching: a geometric approach with applications to string matching problems
• On space efficient two dimensional range minimum data structures
• Orthogonal range searching for text indexing
• Orthogonal range searching on the RAM, revisited
• Space-efficient string indexing for wildcard pattern matching
• Text Indexing and Dictionary Matching with One Error

Cited in

(12)

• A new method for approximate indexing and dictionary lookup with one error
• Text Indexing and Dictionary Matching with One Error
• Compressed string dictionary search with edit distance one
• Improved bounds for dictionary look-up with one error
• Fast entropy-bounded string dictionary look-up with mismatches
• Improved space-time tradeoffs for approximate full-text indexing with one edit error
• Compressed string dictionary look-up with edit distance one
• Index structures for fast similarity search for symbol strings
• Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
• scientific article; zbMATH DE number 2185612 (Why is no real title available?)
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Dictionary Look-Up with One Error

This page was built for publication: Fast string dictionary lookup with one error

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942250)