Add to ORKGA 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
We have presented a fast linear time algorithm for recognizing tandem repeats. Our algorithm is a on...
Given a text string x of n symbols and an integer constant d, we consider the problem of finding, fo...
Abstract. Given a string x = x[1..n] on an alphabet of size α, and a threshold pmin ≥ 1, we first de...
AbstractA tandem repeat (or square) is a string αα, where α is a non-empty string. We present an O(|...
Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a...
AbstractWe study the problem of detecting all occurrences of (primitive) tandem repeats and tandem a...
Abstract. We study the problem of detecting all occurrences of (prim-itive) tandem repeats and tande...
Gusfield D, Stoye J. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a...
Stoye J, Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree. Theore...
The most efficient methods currently available for the computation of repetitions or repeats in a st...
AbstractAn algorithm is presented to detect—within optimal time O(n log n) and space O(n), off-line ...
We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings...
this paper, we focus on repetitive sequences in which short words are repeated many times, referred ...
Given a string x = x[1..n] on an alphabet of size α, and a threshold p min ≥ 1, we describe four var...
Background: Tandem duplication, in the context of molecular biology, occurs as a result of mutationa...
We have presented a fast linear time algorithm for recognizing tandem repeats. Our algorithm is a on...
Given a text string x of n symbols and an integer constant d, we consider the problem of finding, fo...
Abstract. Given a string x = x[1..n] on an alphabet of size α, and a threshold pmin ≥ 1, we first de...
AbstractA tandem repeat (or square) is a string αα, where α is a non-empty string. We present an O(|...
Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a...
AbstractWe study the problem of detecting all occurrences of (primitive) tandem repeats and tandem a...
Abstract. We study the problem of detecting all occurrences of (prim-itive) tandem repeats and tande...
Gusfield D, Stoye J. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a...
Stoye J, Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree. Theore...
The most efficient methods currently available for the computation of repetitions or repeats in a st...
AbstractAn algorithm is presented to detect—within optimal time O(n log n) and space O(n), off-line ...
We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings...
this paper, we focus on repetitive sequences in which short words are repeated many times, referred ...
Given a string x = x[1..n] on an alphabet of size α, and a threshold p min ≥ 1, we describe four var...
Background: Tandem duplication, in the context of molecular biology, occurs as a result of mutationa...
We have presented a fast linear time algorithm for recognizing tandem repeats. Our algorithm is a on...
Given a text string x of n symbols and an integer constant d, we consider the problem of finding, fo...
Abstract. Given a string x = x[1..n] on an alphabet of size α, and a threshold pmin ≥ 1, we first de...