Publication:4820869
From MaRDI portal
zbMath1088.68679MaRDI QIDQ4820869
Yudong Tang, Frantisek Franek, W. F. Smyth
Publication date: 1 October 2004
Related Items
The geometric properties of an infinitary line and plane languages, Alphabet-independent algorithms for finding context-sensitive repeats in linear time, New complexity results for the \(k\)-covers problem, Fast, practical algorithms for computing all the repeats in a string, Repetitions in strings: algorithms and combinatorics, Computing regularities in strings: a survey, Longest repeats with a block of \(k\) don't cares