An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Text algorithms
Application of combinatorial analysis to repetitions in strings, phylogeny, and parallel multiplier design
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
How many squares can a string contain?
Journal of Combinatorial Theory Series A
The exact number of squares in Fibonacci words
Theoretical Computer Science
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
An Algorithm for Approximate Tandem Repeats
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Computation of Squares in a String (Preliminary Version)
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
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
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
The Enhanced Suffix Array and Its Applications to Genome Analysis
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Locating All Tandem Repeat Families in a Sequence
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
FireμSat: meeting the challenge of detecting microsatellites in DNA
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
An efficient algorithm for online square detection
Theoretical Computer Science - Computing and combinatorics
Efficient on-line repetition detection
Theoretical Computer Science
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms
A fast algorithm for finding the positions of all squares in a run-length encoded string
Theoretical Computer Science
Algorithms for finding a minimum repetition representation of a string
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Fast algorithms for finding a minimum repetition representation of strings and trees
Discrete Applied Mathematics
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
| Hi-index | 5.23 |
We study the problem of detecting all occurrences of (primitive) tandem repeats and tandem arrays in a string. We first give a simple time- and space-optimal algorithm to find all tandem repeats, and then modify it to become a time and space-optimal algorithm for finding only the primitive tandem repeats. Both of these algorithms are then extended to handle tandem arrays. The contribution of this paper is both pedagogical and practical, giving simple algorithms and implementations based on a suffix tree, using only standard tree traversal techniques