38 search results - page 2 / 8 » Engineering a Lightweight Suffix Array Construction Algorith... |
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
CPM
2009
Springer
13 years 3 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
CPM
2009
Springer
13 years 8 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
DCC
2009
IEEE
14 years 5 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...