Counting Colours in Compressed Strings

Details Counting Colours in Compressed Strings Counting Colours in Compressed Strings

2010-11-15

arxiv.org/abs/1011.3480v1

Computer Science

Data Structures and Algorithms

Scientific paper

Suppose we are asked to preprocess a string \(s [1..n]\) such that later, given a substring's endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes \(n H_0 (s) + \Oh{n} + \oh{n H_0 (s)}\) bits, where \(H_0 (s)\) is the 0th-order empirical entropy of $s$, and answers queries in $\Oh{\log^{1 + \epsilon} n}$ time for any constant \(\epsilon > 0\). We also show how our data structure can be made partially dynamic.

Affiliated with

Also associated with

No associations

Rating

Counting Colours in Compressed Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Colours in Compressed Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Colours in Compressed Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-299588