90 search results - page 1 / 18 » Suffix tree construction algorithms on modern hardware |
EDBT
2010
ACM
13 years 8 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
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...
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...
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...
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...