Lempel-Ziv factorization powered by space efficient suffix trees
type: Item
instance of: scholarly article
title: Lempel-Ziv factorization powered by space efficient suffix trees
zbMATH Open document ID: 1392.68184
author: Johannes Fischer
author: Dominik Köppl
author: Kunihiko Sadakane
author: Tomohiro I
published in: Algorithmica
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6910195
zbMATH Keywords: Lempel-Ziv
zbMATH Keywords: lossless compression
zbMATH Keywords: succinct suffix trees
describes a project that uses: LZ77
MaRDI profile type: Publication
full work available at URL: s00453-017-0333-1
OpenAlex ID: W2737421126
cites work: Improved dynamic dictionary matching
cites work: Linear time construction of compressed text indices in compact space
cites work: Range Predecessor and Lempel-Ziv Parsing
cites work: Compressed suffix trees with full functionality
cites work: Representing trees of higher degree
cites work: Transducers and repetitions
cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: Linear-time computation of local periods
cites work: Raising Permutations to Powers in Place
cites work: Fully functional static and dynamic succinct trees
cites work: Indexing compressed text
cites work: Alphabet-Dependent String Searching with Wexponential Search Trees
cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
cites work: Radix Sorting with No Extra Space
cites work: A Faster Grammar-Based Self-index
cites work: LZ77-Based Self-indexing with Faster Pattern Matching
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Compression of individual sequences via variable-rate coding
cites work: Ultra-succinct representation of ordered trees with applications
cites work: Linked dynamic tries with applications to LZ-compression in sublinear time and space
cites work: Lempel-Ziv index for \(q\)-grams
cites work: Linear work suffix array construction
cites work: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
cites work: Detecting leftmost maximal periodicities
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
cites work: Constructing LZ78 tries and position heaps in linear time for large alphabets
cites work: Indexing text using the Ziv--Lempel trie
cites work: Optimal Dynamic Sequence Representations
cites work: Fully-Compressed Suffix Trees
cites work: Q4828936
cites work: Squeezing succinct data structures into entropy bounds
cites work: Data compression via textual substitution
cites work: Engineering a compressed suffix tree implementation
cites work: A universal algorithm for sequential data compression
DOI: 10.1007/S00453-017-0333-1
description: scientific article; zbMATH DE number 6910195