An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Finding Repeats with Fixed Gap
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
An optimal algorithm for online square detection
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
A q-repetition is the concatenation of q copies of a primitive string, where q≥2. Given a string S character by character, the on-line repetition detection problem is to determine whether S contains a q-repetition in an on-line manner. For q=2, the problem can be solved in O(mlogβ) time, where m is the ending position of the first 2-repetition and β is the number of distinct characters in the m-th prefix of S. In this paper, we present an on-line algorithm that can detect a q-repetition for q≥3 with the same time complexity.