170 search results - page 1 / 34 » Algorithms on Compressed Strings and Arrays |
89
Voted
SOFSEM
1999
Springer
15 years 8 months ago
1999
Springer
124
Voted
IJFCS
2006
15 years 3 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
133
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
105
click to vote
CPM
2010
Springer
15 years 8 months ago
2010
Springer
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
123
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...