A grouping approach for succinct dynamic dictionary matching

DOI10.1007/s00453-015-0056-0zbMath1359.68335OpenAlexW2097945468MaRDI QIDQ513298

Ely Porat, Ariel Shiftan, Guy Feigenblat

Publication date: 6 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0056-0

zbMATH Keywords

online algorithmscompressionpattern matchingdictionary matchingAho-Corasick automatonsuccinct

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (2)

Compressed Multiple Pattern Matching ⋮ Efficient dynamic dictionary matching with DAWGs and AC-automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic dictionary matching
• Improved dynamic dictionary matching
• Faster compressed dictionary matching
• Compressing dictionary matching index via sparsification technique
• Indexing compressed text
• Succinct Dictionary Matching with No Slowdown
• Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Efficient Storage and Retrieval by Content and Address of Static Files
• More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

This page was built for publication: A grouping approach for succinct dynamic dictionary matching