Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>

Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>

We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-overlapping reverse factor table [Crochemore et al...

Full description

Bibliographic Details
Main Author: Dominik Köppl
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Algorithms
Subjects:
longest previous non-overlapping reverse factor table
application of suffix trees
reversed Lempel–Ziv factorization
lossless compression
Online Access:https://www.mdpi.com/1999-4893/14/6/161
id doaj-d1b994ace2a24dcb8f9e6aebfe0d36de
record_format Article
spelling doaj-d1b994ace2a24dcb8f9e6aebfe0d36de2021-06-01T00:43:15ZengMDPI AGAlgorithms1999-48932021-05-011416116110.3390/a14060161Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>Dominik Köppl0M&D Data Science Center, Tokyo Medical and Dental University, Tokyo 113-8510, JapanWe present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-overlapping reverse factor table [Crochemore et al., JDA’12] within the same space but pay a multiplicative logarithmic time penalty.https://www.mdpi.com/1999-4893/14/6/161longest previous non-overlapping reverse factor tableapplication of suffix treesreversed Lempel–Ziv factorizationlossless compression
collection DOAJ
language English
format Article
sources DOAJ
author Dominik Köppl
spellingShingle Dominik Köppl
Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
Algorithms
longest previous non-overlapping reverse factor table
application of suffix trees
reversed Lempel–Ziv factorization
lossless compression
author_facet Dominik Köppl
author_sort Dominik Köppl
title Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
title_short Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
title_full Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
title_fullStr Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
title_full_unstemmed Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
title_sort reversed lempel–ziv factorization with suffix trees <sup>†</sup>
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2021-05-01
description We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-overlapping reverse factor table [Crochemore et al., JDA’12] within the same space but pay a multiplicative logarithmic time penalty.
topic longest previous non-overlapping reverse factor table
application of suffix trees
reversed Lempel–Ziv factorization
lossless compression
url https://www.mdpi.com/1999-4893/14/6/161
work_keys_str_mv AT dominikkoppl reversedlempelzivfactorizationwithsuffixtreessupsup
_version_ 1721414167695458304

Similar Items