Converting SLP to LZ78 in almost Linear Time
From MaRDI portal
Publication:4928557
DOI10.1007/978-3-642-38905-4_6zbMath1382.68343OpenAlexW1598522464MaRDI QIDQ4928557
Hideo Bannai, Masayuki Takeda, Paweł Gawrychowski, Shunsuke Inenaga
Publication date: 14 June 2013
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_6
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items
Longest common extensions in trees, Longest Common Extensions in Trees, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Unnamed Item, LZ77 computation based on the run-length encoded BWT