LEMPEL-ZIV SLIDING WINDOW UPDATE WITH SUFFIX ARRAYS
The sliding window dictionary-based algorithms of the Lempel-Ziv (LZ) 77 family are widely used for universal lossless data compression. The encoding component of these algorithms performs repeated substring search. Data structures, such as hash tables, binary search trees, and suffix trees have bee...
Main Authors: | Artur Ferreira, Arlindo Oliveira, Mario Figueiredo |
---|---|
Format: | Article |
Language: | English |
Published: |
Instituto Superior de Engenharia de Lisboa (ISEL)
2013-06-01
|
Series: | ISEL Academic Journal of Electronics, Telecommunications and Computers |
Subjects: | |
Online Access: | http://journals.isel.pt/index.php/i-ETC/article/view/6 |
Similar Items
-
Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
by: Dominik Köppl
Published: (2021-05-01) -
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
by: Dominik Köppl
Published: (2021-01-01) -
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) -
A Lempel-Ziv like approach for signal classification
by: J. Montalvão, et al. -
Autoíndices Comprimidos para Texto Basados en Lempel-Ziv
by: Arroyuelo Billiardi, Diego Gastón
Published: (2012)