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
id doaj-5a609c2adb3946c9bc8d5815e0a16bf5
record_format Article
spelling doaj-5a609c2adb3946c9bc8d5815e0a16bf52021-01-30T00:05:09ZengMDPI AGAlgorithms1999-48932021-01-0114444410.3390/a14020044Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix TreesDominik Köppl0M&D Data Science Center, Tokyo Medical and Dental University, Tokyo 113-8510, JapanWe 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 to answer substring compression queries for the Lempel–Ziv-78 factorization with a possible logarithmic multiplicative slowdown depending on the used suffix tree representation.https://www.mdpi.com/1999-4893/14/2/44substring compression querylongest previous non-overlapping factor tableapplication of suffix treesnon-overlapping Lempel–Ziv factorizationlossless compressionLempel–Ziv-78 factorization
collection DOAJ
language English
format Article
sources DOAJ
author Dominik Köppl
spellingShingle Dominik Köppl
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
Algorithms
substring compression query
longest previous non-overlapping factor table
application of suffix trees
non-overlapping Lempel–Ziv factorization
lossless compression
Lempel–Ziv-78 factorization
author_facet Dominik Köppl
author_sort Dominik Köppl
title Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
title_short Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
title_full Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
title_fullStr Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
title_full_unstemmed Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
title_sort non-overlapping lz77 factorization and lz78 substring compression queries with suffix trees
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2021-01-01
description 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 to answer substring compression queries for the Lempel–Ziv-78 factorization with a possible logarithmic multiplicative slowdown depending on the used suffix tree representation.
topic substring compression query
longest previous non-overlapping factor table
application of suffix trees
non-overlapping Lempel–Ziv factorization
lossless compression
Lempel–Ziv-78 factorization
url https://www.mdpi.com/1999-4893/14/2/44
work_keys_str_mv AT dominikkoppl nonoverlappinglz77factorizationandlz78substringcompressionquerieswithsuffixtrees
_version_ 1724318393069207552

Similar Items