Compressed Multiple Pattern Matching
From MaRDI portal
Recommendations
- Succinct Dictionary Matching with No Slowdown
- Average optimal string matching in packed strings
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- scientific article; zbMATH DE number 1839439
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- A grouping approach for succinct dynamic dictionary matching
- Algorithms on Strings, Trees and Sequences
- An analysis of the Burrows-Wheeler transform
- Boosting textual compression in optimal linear time
- Compressed representations of sequences and full-text indexes
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Dictionary matching in a stream
- Dynamic dictionary matching and compressed suffix trees
- Efficient string matching
- Faster compressed dictionary matching
- Fully functional static and dynamic succinct trees
- Greedy shortest common superstring approximation in compact space
- Jewels of Stringology
- Large alphabets and incompressibility
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Succinct 2D dictionary matching
- Succinct Dictionary Matching with No Slowdown
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct online dictionary matching with improved worst-case guarantees
- Ultra-succinct representation of ordered trees with applications
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)
