Simple and efficient LZW-compressed multiple pattern matching
From MaRDI portal
Publication:2442814
DOI10.1016/j.jda.2013.10.004zbMath1284.68257MaRDI QIDQ2442814
Publication date: 1 April 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.10.004
68R15: Combinatorics on words
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68W32: Algorithms on strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for a special case of disjoint set union
- Making data structures persistent
- Stronger Lempel-Ziv based compressed text indexing
- Optimal Pattern Matching in LZW Compressed Strings
- Pattern matching in compressed texts
- Substring Range Reporting
- Linear work suffix array construction
- String Matching in Real Time
- Efficient string matching
- Fast Pattern Matching in Strings