53 search results - page 1 / 11 » Practical methods for constructing suffix trees |
VLDB
2005
ACM
14 years 5 months ago
2005
ACM
SODA
1990
ACM
13 years 5 months 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...
CIKM
2009
Springer
13 years 8 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
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...
JACM
2006
13 years 4 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...