170 search results - page 5 / 34 » Algorithms on Compressed Strings and Arrays |
69
Voted
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
73
Voted
SODA
2004
ACM
14 years 11 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...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
120
click to vote
CPM
2009
Springer
14 years 7 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
161
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...