TY  - JOUR
AB  - 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.
DA  - 2002
DO  - 10.1016/S0304-3975(01)00121-9
KW  - Sequence analysis
KW  - Tandem repeats
KW  - Suffix tree
KW  - Tandem arrays
KW  - Repeats
LA  - eng
IS  - 1-2
M2  - 843
PY  - 2002
SN  - 0304-3975
SP  - 843-856
T2  - Theoretical Computer Science
TI  - Simple and flexible detection of contiguous repeats using a suffix tree
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17733325
Y2  - 2024-11-22T04:53:58
ER  -