LZ77 computation based on the run-length encoded BWT
type: Item
instance of: scholarly article
title: LZ77 computation based on the run-length encoded BWT
zbMATH Open document ID: 1392.68186
author: Alberto Policriti
author: Nicola Prezza
published in: Algorithmica
publication date: 2018-07-25T00:00:00Z
full work available at URL: http://hdl.handle.net/11385/192332
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6910193
zbMATH Keywords: run-length encoded BWT
zbMATH Keywords: Lempel-Ziv factorization
zbMATH Keywords: repetitive text collections
zbMATH Keywords: repetition-aware data structures
describes a project that uses: DYNAMIC
describes a project that uses: get-git-revisions
describes a project that uses: LZ77
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W2736180370
cites work: Converting SLP to LZ78 in almost Linear Time
cites work: Efficient LZ78 Factorization of Grammar Compressed Text
cites work: Composite Repetition-Aware Data Structures
cites work: Range Predecessor and Lempel-Ziv Parsing
cites work: The Smallest Grammar Problem
cites work: Self-Indexed Grammar-Based Compression
cites work: Computing longest previous factor in linear time and applications
cites work: Burrows-Wheeler transform and Sturmian words
cites work: On compressing and indexing repetitive sequences
cites work: String Processing and Information Retrieval
cites work: Factorizations of the Fibonacci Infinite Word
cites work: Approximating LZ77 via Small-Space Multiple-Pattern Matching
cites work: Large alphabets and incompressibility
cites work: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
cites work: Optimal Dynamic Sequence Representations
cites work: Fully Dynamic Data Structure for LCE Queries in Compressed Space
cites work: Lempel-Ziv Factorization Revisited
cites work: Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
cites work: A universal algorithm for sequential data compression
DOI: 10.1007/S00453-017-0327-Z
Recommended article: From LZ77 to the run-length encoded burrows-wheeler transform, and back
Recommended article: Burrows-Wheeler transform and run-length enconding
Recommended article: On the approximation ratio of LZ-end to LZ77
Recommended article: Q5283997
Recommended article: Q3304145
Recommended article: Efficient algorithms for Lempel-Ziv encoding
Recommended article: Space-efficient computation of the LCP array from the Burrows-Wheeler transform
Recommended article: A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
Recommended article: Approximating LZ77 via Small-Space Multiple-Pattern Matching
Recommended article: Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform
description: scientific article; zbMATH DE number 6910193