56 search results - page 4 / 12 » Practical Compressed Suffix Trees |
CPM
2008
Springer
13 years 10 months ago
2008
Springer
CPM
2008
Springer
13 years 10 months ago
2008
Springer
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
ICALP
2007
Springer
14 years 13 days ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...