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...
Main Author: | Dominik Köppl |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/6/161 |
Similar Items
-
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
by: Dominik Köppl
Published: (2021-01-01) -
LEMPEL-ZIV SLIDING WINDOW UPDATE WITH SUFFIX ARRAYS
by: Artur Ferreira, et al.
Published: (2013-06-01) -
Autoíndices Comprimidos para Texto Basados en Lempel-Ziv
by: Arroyuelo Billiardi, Diego Gastón
Published: (2012) -
OPTIMIZING LEMPEL-ZIV FACTORIZATION FOR THE GPU ARCHITECTURE
by: Ching, Bryan
Published: (2014) -
Distance-Based Lempel–Ziv Complexity for the Analysis of Electroencephalograms in Patients with Alzheimer’s Disease
by: Samantha Simons, et al.
Published: (2017-03-01)