An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Theoretical Computer Science
Detecting leftmost maximal periodicities
Discrete Applied Mathematics - Combinatorics and complexity
Text algorithms
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
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
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
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
Linear-time computation of local periods
Theoretical Computer Science
ViPER: augmenting automatic information extraction with visual perceptions
Proceedings of the 14th ACM international conference on Information and knowledge management
Comparing Tandem Repeats with Duplications and Excisions of Variable Degree
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An efficient algorithm for online square detection
Theoretical Computer Science - Computing and combinatorics
Computing suffix links for suffix trees and arrays
Information Processing Letters
A note on the number of squares in a word
Theoretical Computer Science
Genome-scale disk-based suffix tree indexing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
Efficient on-line repetition detection
Theoretical Computer Science
On the tiling by translation problem
Discrete Applied Mathematics
Serial and parallel methods for i/o efficient suffix tree construction
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A fast algorithm for finding the positions of all squares in a run-length encoded string
Theoretical Computer Science
Practical Algorithms for the Longest Common Extension Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Abstractions in Process Mining: A Taxonomy of Patterns
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Indexing genomic sequences on the IBM Blue Gene
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
I/O efficient algorithms for serial and parallel suffix tree construction
ACM Transactions on Database Systems (TODS)
Distinct squares in run-length encoded strings
Theoretical Computer Science
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Algorithms for finding a minimum repetition representation of a string
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Extracting powers and periods in a string from its runs structure
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Lempel-Ziv factorization revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Towards a unified solution: data record region detection and segmentation
Proceedings of the 20th ACM international conference on Information and knowledge management
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
An optimal algorithm for detecting pseudo-squares
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
On suffix extensions in suffix trees
Theoretical Computer Science
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Computing lempel-ziv factorization online
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
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
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.01 |
A tandem repeat (or square) is a string αα, where α is a non-empty string. We present an O(|S|)-time algorithm that operates on the suffix tree T(S) for a string S, finding and marking the endpoint in T(S) of every tandem repeat that occurs in S. This decorated suffix tree implicitly represents all occurrences of tandem repeats in S, and can be used to efficiently solve many questions concerning tandem repeats and tandem arrays in S. This improves and generalizes several prior efforts to efficiently capture large subsets of tandem repeats.