scientific article
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2012.624zbMath1245.68082arXiv1109.4034MaRDI QIDQ2904799
Publication date: 23 August 2012
Full work available at URL: https://arxiv.org/abs/1109.4034
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items
String Indexing with Compressed Patterns, Sensitivity of string compressors and repetitiveness measures, Simple and efficient LZW-compressed multiple pattern matching, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, The complexity of compressed membership problems for finite automata