8 search results - page 1 / 2 » Linear Time Suffix Array Construction Using D-Critical Subst... |
CPM
2009
Springer
14 years 2 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...
SODA
1990
ACM
14 years 2 days ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
CPM
2007
Springer
14 years 2 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
DCC
2009
IEEE
14 years 11 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...