scientific article; zbMATH DE number 1390079
From MaRDI portal
Recommendations
Cited in
(36)- Finding approximate repetitions under Hamming distance.
- Computing regularities in strings: a survey
- On the maximum number of cubic subwords in a word
- Computing the maximum exponent in a stream
- Some results on the number of periodic factors in words
- Three overlapping squares: the general case characterized \& applications
- Prefix frequency of lost positions
- More results on overlapping squares
- On del-robust primitive words
- On the Maximal Sum of Exponents of Runsin a String
- REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- scientific article; zbMATH DE number 5717191 (Why is no real title available?)
- On the maximal number of cubic subwords in a string
- A computational framework for determining run-maximal strings
- The three squares lemma revisited
- On the maximal sum of exponents of runs in a string
- scientific article; zbMATH DE number 2089987 (Why is no real title available?)
- Computing the number of cubic runs in standard Sturmian words
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- Small-space LCE data structure with constant-time queries
- Almost linear time computation of maximal repetitions in run length encoded strings
- Abelian repetitions in Sturmian words
- New complexity results for the k-covers problem
- Space efficient search for maximal repetitions
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- Simple and flexible detection of contiguous repeats using a suffix tree
- Largest repetition factorization of Fibonacci words
- Fibonacci pictures on a binary alphabet
- Counting maximal-exponent factors in words
- Efficient algorithms to compute closed substrings
- On primary and secondary repetitions in words
- Computing maximal-exponent factors in an overlap-free word
- Maximal repetitions in strings
- How many runs can a string contain?
- On maximal repetitions of arbitrary exponent
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934345)
