Compressed Multiple Pattern Matching

DOI10.4230/LIPICS.CPM.2019.13OpenAlexW2963313592MaRDI QIDQ5088902

Dmitry Kosolobov, Nikita Sivukhin

Publication date: 18 July 2022

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

zbMATH Keywords

multiple pattern matchingAho-Corasick automatoncompressed space

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Reverse-Safe Text Indexing ⋮ Streaming dictionary matching with mismatches

Cites Work

• Unnamed Item
• Unnamed Item
• Ultra-succinct representation of ordered trees with applications
• A grouping approach for succinct dynamic dictionary matching
• Large alphabets and incompressibility
• Faster compressed dictionary matching
• Succinct 2D dictionary matching
• Fully Functional Static and Dynamic Succinct Trees
• Compressed representations of sequences and full-text indexes
• An analysis of the Burrows—Wheeler transform
• Dictionary Matching in a Stream
• Boosting textual compression in optimal linear time
• Succinct Dictionary Matching with No Slowdown
• Efficient string matching
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Real-Time Streaming Multi-Pattern Search for Constant Alphabet
• Greedy Shortest Common Superstring Approximation in Compact Space
• Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.

This page was built for publication: Compressed Multiple Pattern Matching