An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Detecting leftmost maximal periodicities
Discrete Applied Mathematics - Combinatorics and complexity
Optimal superprimitivity testing for strings
Information Processing Letters
An on-line string superprimitivity test
Information Processing Letters
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
An optimal algorithm to compute all the covers of a string
Information Processing Letters
A correction to “An optimal algorithm to compute all the covers of a string”
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Reducing the space requirement of suffix trees
Software—Practice & Experience
Quasiperiodicity: From detection to normal forms
Automatica (Journal of IFAC)
Repetitive perhaps, but certainly not boring
Theoretical Computer Science
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Repeats with Fixed Gap
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
A note on Crochemore's repetitions algorithm - a fast space-efficient approach
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
A note on Crochemore's repetitions algorithm - a fast space-efficient approach
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms - SPIRE 2002
Computing all repeats using suffix arrays
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Computing the λ-covers of a string
Information Sciences: an International Journal
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
Maximal repetitions in strings
Journal of Computer and System Sciences
How many runs can a string contain?
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
A Simple Algorithm for Computing the Lempel Ziv Factorization
DCC '08 Proceedings of the Data Compression Conference
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
Fast and Practical Algorithms for Computing All the Runs in a String
CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Towards a Solution to the "Runs" Conjecture
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
An Online Algorithm for Finding the Longest Previous Factors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Language and Automata Theory and Applications
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Linear Time Suffix Array Construction Using D-Critical Substrings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Permuted Longest-Common-Prefix Array
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A new approach to the periodicity lemma on strings with holes
Theoretical Computer Science
Combinatorial Algorithms
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
Fundamenta Informaticae - Special Issue on Stringology
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
New complexity results for the k-covers problem
Information Sciences: an International Journal
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The number of runs in a string: improved analysis of the linear upper bound
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Computing the λ-seeds of a string
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The three squares lemma revisited
Journal of Discrete Algorithms
On the Complexity of Finite Sequences
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Minimum Unique Substrings and Maximum Repeats
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Efficient computation of substring equivalence classes with suffix arrays
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
More results on overlapping squares
Journal of Discrete Algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
The aim of this survey is to provide insight into the sequential algorithms that have been proposed to compute exact ''regularities'' in strings; that is, covers (or quasiperiods), seeds, repetitions, runs (or maximal periodicities), and repeats. After outlining and evaluating the algorithms that have been proposed for their computation, I suggest possibly productive future directions of research.