Fast approximate dictionary matching

DOI10.1007/BFB0015431MaRDI QIDQ6487972zbMATH OpenFDO

Authors Fei Shi

Publication date 21 March 2023

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

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Approximation algorithms (68W25) Algorithms on strings (68W32)

Recommendations

• Text Indexing and Dictionary Matching with One Error
• Fast and practical approximate string matching
• Faster approximate string matching
• scientific article; zbMATH DE number 2087055
• Dictionary matching and indexing with errors and don't cares

Cites work

• A Mathematical Theory of Communication
• Bounds for the String Editing Problem
• Efficient string matching
• scientific article; zbMATH DE number 437564 (Why is no real title available?)
• scientific article; zbMATH DE number 804595 (Why is no real title available?)
• Storing a Sparse Table with 0 (1) Worst Case Access Time

Cited in

(7)

• Fast approximate matching of words against a dictionary
• Succinct 2D dictionary matching
• Efficient techniques for approximate record matching modulo permutations
• Succinct Dictionary Matching with No Slowdown
• Alphabet-Independent and Scaled Dictionary Matching
• A practical semi-external memory method for approximate pattern matching
• String Processing and Information Retrieval

This page was built for publication: Fast approximate dictionary matching

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