A \textit{really} simple approximation of smallest grammar
type: Item
instance of: scholarly article
title: A \textit{really} simple approximation of smallest grammar
zbMATH Open document ID: 1333.68156
author: Artur Jeż
published in: Theoretical Computer Science
publication date: 2016-01-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1403.4445
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6534149
zbMATH Keywords: grammar-based compression
zbMATH Keywords: construction of the smallest grammar
zbMATH Keywords: SLP
zbMATH Keywords: compression
zbMATH Keywords: LZ77
describes a project that uses: LZ77
MaRDI profile type: Publication
OpenAlex ID: W1532033082
arXiv ID: 1403.4445
cites work: A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
cites work: The Smallest Grammar Problem
cites work: Fast and Practical Algorithms for Computing All the Runs in a String
cites work: Clustering by Compression
cites work: Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
cites work: Efficient algorithms for Lempel-Ziv encoding
cites work: Approximation of grammar-based compression via recompression
cites work: Faster Fully Compressed Pattern Matching by Recompression
cites work: Q2965507
cites work: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
cites work: Linear work suffix array construction
cites work: Q4347161
cites work: The Similarity Metric
cites work: Algorithmics on SLP-compressed strings: a survey
cites work: Q4386970
cites work: Lempel-Ziv Factorization Revisited
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: A fully linear-time approximation algorithm for grammar-based compression
cites work: The macro model for data compression (Extended Abstract)
DOI: 10.1016/J.TCS.2015.12.032
description: scientific article