Upper bounds on distinct maximal (sub-)repetitions in compressed strings
From MaRDI portal
(Redirected from Publication:832954)
Recommendations
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- On maximal repeats in compressed strings
- On extensions of maximal repeats in compressed strings
- Tight bounds on the maximum number of shortest unique substrings
- Almost linear time computation of maximal repetitions in run length encoded strings
- Sublinear algorithms for approximating string compressibility
- Sublinear Algorithms for Approximating String Compressibility
- scientific article; zbMATH DE number 2185636
- Strings with maximally many distinct subsequences and substrings
- On maximal repeats in strings
Cites work
- scientific article; zbMATH DE number 7651118 (Why is no real title available?)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- Extracting powers and periods in a word from its runs structure
- Maximal repetitions in strings
- On maximal repetitions of arbitrary exponent
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Prefix frequency of lost positions
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- The Smallest Grammar Problem
- The ``runs theorem
- Two-dimensional maximal repetitions
- Uniqueness Theorems for Periodic Functions
Cited in
(2)
This page was built for publication: Upper bounds on distinct maximal (sub-)repetitions in compressed strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832954)
