26 search results - page 1 / 6 » Suffix Vector: A Space-Efficient Suffix Tree Representation |
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
ACSC
2002
IEEE
13 years 9 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
TCS
2008
13 years 4 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
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 ...
ICML
2006
IEEE
14 years 5 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...