Fast approximate dictionary matching

DOI10.1007/BFB0015431zbMATH Open1512.68467MaRDI QIDQ6487972FDOQ6487972

Authors: Fei Shi 

Publication date: 21 March 2023

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

Mathematics Subject Classification ID

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

Cites Work

• A Mathematical Theory of Communication
• Efficient string matching
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for the String Editing Problem

Cited In (7)

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

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)