Dynamic dictionary matching

DOI10.1016/S0022-0000(05)80047-9zbMath0942.68783OpenAlexW1982024542MaRDI QIDQ1337462

Amihood Amir, Raffaele Giancarlo, Zvi Galil, Martin Farach, Kun Soo Park

Publication date: 26 February 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80047-9

Mathematics Subject Classification ID

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

Related Items (17)

Dynamic dictionary matching with failure functions ⋮ A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS ⋮ On updating suffix tree labels ⋮ Pattern matching in hypertext ⋮ Matching a set of strings with variable length don't cares ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Online parameterized dictionary matching with one gap ⋮ Parameterized dictionary matching and recognition with one gap ⋮ Multiple matching of parameterized patterns ⋮ A grouping approach for succinct dynamic dictionary matching ⋮ Internal dictionary matching ⋮ Efficient pattern matching in elastic-degenerate strings ⋮ Dynamic dictionary matching in external memory ⋮ Efficient dynamic dictionary matching with DAWGs and AC-automata ⋮ Dictionary matching with a few gaps ⋮ Compressing dictionary matching index via sparsification technique ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• A fast string searching algorithm
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

This page was built for publication: Dynamic dictionary matching