Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets

DOI10.1007/11682462_15MaRDI QIDQ3525753zbMATH OpenOpenAlexFDO

Authors Abdullah N. Arslan

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_15

zbMATH Keywords

\(d\)-queryapproximate dictionary look-upedit distanceHamming distancepreprocessingspace efficient algorithmsuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2089967
• DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE
• Fast string dictionary lookup with one error
• Improved bounds for dictionary look-up with one error
• Fast entropy-bounded string dictionary look-up with mismatches

Cited in

(6)

• Fast approximate matching of words against a dictionary
• Improved bounds for dictionary look-up with one error
• Simple, compact and robust approximate string dictionary
• scientific article; zbMATH DE number 2089967 (Why is no real title available?)
• Fast entropy-bounded string dictionary look-up with mismatches
• DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE

This page was built for publication: Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets

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