Succinct Dictionary Matching with No Slowdown

DOI10.1007/978-3-642-13509-5_9zbMath1286.68521arXiv1001.2860OpenAlexW3101778446MaRDI QIDQ3575239

Djamal Belazzougui

Publication date: 26 July 2010

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

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

Mathematics Subject Classification ID

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

Related Items (21)

Succinct 2D dictionary matching ⋮ Dictionary Matching with Uneven Gaps ⋮ Faster Lightweight Lempel-Ziv Parsing ⋮ Compressed indexes for text with wildcards ⋮ Compressed text indexing with wildcards ⋮ Fast circular dictionary-matching algorithm ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ Worst-case efficient single and multiple string matching on packed texts in the word-RAM model ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Worst Case Efficient Single and Multiple String Matching in the RAM Model ⋮ Searching and Indexing Circular Patterns ⋮ Succincter Text Indexing with Wildcards ⋮ A grouping approach for succinct dynamic dictionary matching ⋮ Unnamed Item ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ Compressed Multiple Pattern Matching ⋮ Streaming Dictionary Matching with Mismatches ⋮ Compressed automata for dictionary matching ⋮ Compressing dictionary matching index via sparsification technique ⋮ On the complexity of recognizing Wheeler graphs ⋮ Streaming dictionary matching with mismatches

This page was built for publication: Succinct Dictionary Matching with No Slowdown