Wee LCP

Details Wee LCP Wee LCP

2009-10-16

arxiv.org/abs/0910.3123v2

Computer Science

Data Structures and Algorithms

Scientific paper

We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are sufficient to answer LCP-queries asymptotically in the same time that is needed to retrieve an entry from the suffix array. This yields the smallest compressed suffix tree with sub-logarithmic navigation time.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124018