Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limited space. With similar techniques, we show how...

Full description

Bibliographic Details
Main Author: Dominik Köppl
Format: Article
Language:English
Published: MDPI AG 2021-01-01
Series:Algorithms
Subjects:
substring compression query
longest previous non-overlapping factor table
application of suffix trees
non-overlapping Lempel–Ziv factorization
lossless compression
Lempel–Ziv-78 factorization
Online Access:https://www.mdpi.com/1999-4893/14/2/44

Internet

https://www.mdpi.com/1999-4893/14/2/44

Similar Items