Upper bounds on distinct maximal (sub-)repetitions in compressed strings
type: Item
instance of: scholarly article
title: Upper bounds on distinct maximal (sub-)repetitions in compressed strings
DOI: 10.1007/978-3-030-81508-0_26
author: Julian Pape-Lange
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7498736
zbMATH Keywords: maximal repetitions
zbMATH Keywords: maximal subrepetitions
zbMATH Keywords: combinatorics on words
zbMATH Keywords: compressed strings
describes a project that uses: Combinatorics_Words
MaRDI profile type: Publication
full work available at URL: 978-3-030-81508-0 26
OpenAlex ID: W3190425932
cites work: Two-dimensional maximal repetitions
cites work: The “Runs” Theorem
cites work: The Smallest Grammar Problem
cites work: Extracting powers and periods in a word from its runs structure
cites work: Maximal repetitions in strings
cites work: Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats
cites work: Uniqueness Theorems for Periodic Functions
cites work: Efficiently Finding All Maximal alpha-gapped Repeats
cites work: Prefix frequency of lost positions
cites work: On maximal repetitions of arbitrary exponent
cites work: Q5874457
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
Recommended article: Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
Recommended article: Q5088908
Recommended article: Q5874457
Recommended article: Tight bounds on the maximum number of shortest unique substrings
Recommended article: Almost linear time computation of maximal repetitions in run length encoded strings
Recommended article: Sublinear algorithms for approximating string compressibility
Recommended article: Sublinear Algorithms for Approximating String Compressibility
Recommended article: Q3024802
Recommended article: Strings with maximally many distinct subsequences and substrings
Recommended article: On maximal repeats in strings
description: scientific article; zbMATH DE number 7498736