An Improved Query Time for Succinct Dynamic Dictionary Matching

DOI10.1007/978-3-319-07566-2_13zbMath1407.68108OpenAlexW83950982MaRDI QIDQ5165598

Ariel Shiftan, Guy Feigenblat, Ely Porat

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07566-2_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Algorithms on strings (68W32)

Related Items

Dictionary Matching with Uneven Gaps ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Efficient dynamic dictionary matching with DAWGs and AC-automata ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet