140 search results - page 2 / 28 » Practical Suffix Tree Construction |
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
TCS
2008
13 years 5 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...
ACSC
2002
IEEE
13 years 10 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...
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 ...
ALGORITHMICA
1999
13 years 5 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...