DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE

DOI10.1142/S0129054104002303MaRDI QIDQ5696965zbMATH OpenFDO

Authors Abdullah N. Arslan, Ömer Eğecioğlu

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(d\)-query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 2089967
• Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
• Dictionary Look-Up with One Error
• Improved bounds for dictionary look-up with one error
• Faster and Space-Optimal Edit Distance “1” Dictionary

Cites work

• Algorithms for approximate string matching
• Algorithms on Strings, Trees and Sequences
• An \(O(ND)\) difference algorithm and its variations
• An algorithm for approximate membership checking with application to password security
• Dictionary Look-Up with One Error
• Efficient algorithms for approximate string matching with swaps
• Improved bounds for dictionary look-up with one error
• The String-to-String Correction Problem

Cited in

(5)

• Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
• Improved bounds for dictionary look-up with one error
• Variants of constrained longest common subsequence
• scientific article; zbMATH DE number 2089967 (Why is no real title available?)
• Dictionary Look-Up with One Error

This page was built for publication: DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE

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