Fast and Practical Algorithms for Computing All the Runs in a String
From MaRDI portal
Publication:3506932
DOI10.1007/978-3-540-73437-6_31zbMath1138.68658MaRDI QIDQ3506932
W. F. Smyth, Gang Chen, Simon J. Puglisi
Publication date: 17 June 2008
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_31
Related Items
The “Runs” Theorem, Extracting powers and periods in a word from its runs structure, The three squares lemma revisited, New complexity results for the \(k\)-covers problem, A \textit{really} simple approximation of smallest grammar, Efficient on-line repetition detection, Computing longest previous factor in linear time and applications, Repetitions in strings: algorithms and combinatorics, Computing regularities in strings: a survey, Faster online computation of the succinct longest previous factor array, Ostrowski-automatic sequences: theory and applications, Three overlapping squares: the general case characterized \& applications, More results on overlapping squares, Speeding up the detection of tandem repeats over the edit distance, Faster semi-external suffix sorting, An Online Algorithm for Finding the Longest Previous Factors