Publication:4934345
From MaRDI portal
zbMath0948.68139MaRDI QIDQ4934345
Gregory Kucherov, Roman M. Kolpakov
Publication date: 26 April 2000
68R15: Combinatorics on words
Related Items
A Linear-Time Algorithm for Seeds Computation, 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, Simple and flexible detection of contiguous repeats using a suffix tree, On del-robust primitive words, A computational framework for determining run-maximal strings, The three squares lemma revisited, On the maximal sum of exponents of runs in a string, Computing the number of cubic runs in standard Sturmian words, New complexity results for the \(k\)-covers problem, Space efficient search for maximal repetitions, Maximal repetitions in strings, How many runs can a string contain?, On maximal repetitions of arbitrary exponent, 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, Three overlapping squares: the general case characterized \& applications, Prefix frequency of lost positions, More results on overlapping squares, On the Maximal Sum of Exponents of Runsin a String, Decision algorithms for Fibonacci-automatic Words, I: Basic results
