An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Theoretical Computer Science
Optimal superprimitivity testing for strings
Information Processing Letters
An on-line string superprimitivity test
Information Processing Letters
Efficient detection of quasiperiodicities in strings
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
Computing the covers of a string in linear time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Quasiperiodicity: From detection to normal forms
Automatica (Journal of IFAC)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Of Periods, Quasiperiods, Repetitions and Covers
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computing regularities in strings: A survey
European Journal of Combinatorics
Computing the maximal-exponent repeats of an overlap-free string in linear time
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient seed computation revisited
Theoretical Computer Science
| Hi-index | 0.00 |
Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes in the suffix tree that have a superprimitive path-label.