TY  - JOUR
AB  - A tandem repeat (or square) is a string [alpha][alpha], where [alpha] 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.
DA  - 2004
DO  - 10.1016/j.jcss.2004.03.004
LA  - eng
IS  - 4
M2  - 525
PY  - 2004
SN  - 0022-0000
SP  - 525-546
T2  - Journal of computer and system sciences
TI  - Linear time algorithms for finding and representing all the tandem repeats in a string
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17735692
Y2  - 2024-11-22T03:22:40
ER  -