Upper bounds on distinct maximal (sub-)repetitions in compressed strings
From MaRDI portal
Publication:832954
DOI10.1007/978-3-030-81508-0_26OpenAlexW3190425932MaRDI QIDQ832954FDOQ832954
Authors: Julian Pape-Lange 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_26
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
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Uniqueness Theorems for Periodic Functions
- Extracting powers and periods in a word from its runs structure
- The ``runs theorem
- The Smallest Grammar Problem
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- Maximal repetitions in strings
- On maximal repetitions of arbitrary exponent
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- Two-dimensional maximal repetitions
- Prefix frequency of lost positions
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
