Lower bounds for the number of repetitions in 2D strings
From MaRDI portal
Publication:2146138
Recommendations
Cites work
- scientific article; zbMATH DE number 5717191 (Why is no real title available?)
- scientific article; zbMATH DE number 1948509 (Why is no real title available?)
- scientific article; zbMATH DE number 7651171 (Why is no real title available?)
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Distinct squares in circular words
- Episturmian words and some constructions of de Luca and Rauzy
- Extracting powers and periods in a word from its runs structure
- Fibonacci arrays and their two-dimensional repetitions
- How many double squares can a string contain?
- How many runs can a string contain?
- How many squares can a string contain?
- Maximal repetitions in strings
- Not So Many Runs in Strings
- Optimal parallel two dimensional text searching on a CREW PRAM
- Palindromes in circular words
- Prefix frequency of lost positions
- Square-density increasing mappings
- Squares, cubes, and time-space efficient string searching
- String powers in trees
- The ``runs conjecture
- The ``runs theorem
- The maximum number of squares in a tree
- The number of runs in a string
- Two-Dimensional Periodicity in Rectangular Arrays
- Two-dimensional maximal repetitions
- Two-dimensional maximal repetitions
- Universal reconstruction of a string
Cited in
(4)
This page was built for publication: Lower bounds for the number of repetitions in 2D strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146138)
