Compressed Multiple Pattern Matching
From MaRDI portal
Publication:5088902
DOI10.4230/LIPICS.CPM.2019.13OpenAlexW2963313592MaRDI QIDQ5088902FDOQ5088902
Authors: Dmitry Kosolobov, Nikita Sivukhin 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.01248
Cites Work
- Efficient string matching
- Algorithms on Strings, Trees and Sequences
- Fully functional static and dynamic succinct trees
- Compressed representations of sequences and full-text indexes
- An analysis of the Burrows—Wheeler transform
- Title not available (Why is that?)
- Ultra-succinct representation of ordered trees with applications
- Jewels of Stringology
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Dynamic dictionary matching and compressed suffix trees
- Faster compressed dictionary matching
- Succinct Dictionary Matching with No Slowdown
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Large alphabets and incompressibility
- Succinct 2D dictionary matching
- A grouping approach for succinct dynamic dictionary matching
- Boosting textual compression in optimal linear time
- Greedy Shortest Common Superstring Approximation in Compact Space
- Dictionary Matching in a Stream
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.
Cited In (2)
This page was built for publication: Compressed Multiple Pattern Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088902)
