Succinct Representations of Dynamic Strings

Details Succinct Representations of Dynamic Strings Succinct Representations of Dynamic Strings

2010-05-25

arxiv.org/abs/1005.4652v2

Computer Science

Data Structures and Algorithms

Scientific paper

The rank and select operations over a string of length n from an alphabet of size $\sigma$ have been used widely in the design of succinct data structures. In many applications, the string itself need be maintained dynamically, allowing characters of the string to be inserted and deleted. Under the word RAM model with word size $w=\Omega(\lg n)$, we design a succinct representation of dynamic strings using $nH_0 + o(n)\lg\sigma + O(w)$ bits to support rank, select, insert and delete in $O(\frac{\lg n}{\lg\lg n}(\frac{\lg \sigma}{\lg\lg n}+1))$ time. When the alphabet size is small, i.e. when $\sigma = O(\polylog (n))$, including the case in which the string is a bit vector, these operations are supported in $O(\frac{\lg n}{\lg\lg n})$ time. Our data structures are more efficient than previous results on the same problem, and we have applied them to improve results on the design and construction of space-efficient text indexes.

Affiliated with

Also associated with

No associations

Rating

Succinct Representations of Dynamic 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 Succinct Representations of Dynamic Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Succinct Representations of Dynamic Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-298815