Compressed string dictionary look-up with edit distance one

DOI10.1007/978-3-642-31265-6_23MaRDI QIDQ2904501zbMATH OpenOpenAlexFDO

Authors Djamal Belazzougui, Rossano Venturini

Publication date 14 August 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_23

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Compressed string dictionary search with edit distance one
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Fast string dictionary lookup with one error
• Improved space-time tradeoffs for approximate full-text indexing with one edit error
• Text Indexing and Dictionary Matching with One Error

Cited in

(5)

• Compressed string dictionary search with edit distance one
• Fast string dictionary lookup with one error
• Simple, compact and robust approximate string dictionary
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Fast entropy-bounded string dictionary look-up with mismatches

This page was built for publication: Compressed string dictionary look-up with edit distance one

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