Sciweavers

26 search results - page 1 / 6
» Suffix Vector: A Space-Efficient Suffix Tree Representation
Sort
View
ISAAC
2001
Springer
106views Algorithms» more  ISAAC 2001»
14 years 3 months ago
Suffix Vector: A Space-Efficient Suffix Tree Representation
Krisztián Monostori, Arkady B. Zaslavsky, I...
ACSC
2002
IEEE
14 years 3 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
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...
Krisztián Monostori, Arkady B. Zaslavsky, H...
TCS
2008
13 years 10 months ago
On-line construction of compact suffix vectors and maximal repeats
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...
Élise Prieur, Thierry Lecroq
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
15 years 3 days ago
Engineering a Fast Online Persistent Suffix Tree Construction
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 ...
Srikanta J. Bedathur, Jayant R. Haritsa
ICML
2006
IEEE
14 years 11 months ago
Fast and space efficient string kernels using suffix arrays
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...
Choon Hui Teo, S. V. N. Vishwanathan