Generalized dictionary matching under substring consistent equivalence relations

DOI10.1007/978-3-030-39881-1_11MaRDI QIDQ782170zbMATH OpenOpenAlexFDO

Authors Diptarama Hendrian

Publication date 22 July 2020

Full work available at URL https://arxiv.org/abs/1909.07538

zbMATH Keywords

dictionary matchingAho-Corasick algorithmsubstring consistent equivalence relation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Generalized pattern matching and periodicity under substring consistent equivalence relations
• Efficient dictionary matching by Aho-Corasick automata of truncated patterns
• Compressed automata for dictionary matching
• Compressed automata for dictionary matching
• Succinct Dictionary Matching with No Slowdown

Cited in

(2)

• Alphabet-Independent and Scaled Dictionary Matching
• Generalized pattern matching and periodicity under substring consistent equivalence relations

This page was built for publication: Generalized dictionary matching under substring consistent equivalence relations

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