Results 151 to 160 of about 14,465 (182)
Some of the next articles are maybe not open access.
Computing all Repeats Using Suffix Arrays
2003We describe an algorithm that identifies all the repeating substrings (tandem, overlapping, and split) in a given string $x = x[1...n]$. Given the suffix arrays of $x$ and of the reversed string $\hat{x}$, the algorithm requires $\Theta(n)$ time for its execution and represents its output in $\Theta(n)$ space, either as a reduced suffix array ...
Franěk, F., Smyth, W.F., Tang, Y.
openaire +2 more sources
Suffix cactus: A cross between suffix tree and suffix array
1995The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
openaire +1 more source
efficient dynamic suffix array
2009International ...
Leonard, M., Mouchard, L., Salson, M.
openaire +1 more source
Suffix Arrays: A New Method for On-Line String Searches
SIAM Journal on Computing, 1993Gene Myers
exaly
Constructing suffix arrays in linear time
Journal of Discrete Algorithms, 2005Heejin Park, Kunsoo Park
exaly