Computing Lempel-Ziv Factorization Online

Details Computing Lempel-Ziv Factorization Online Computing Lempel-Ziv Factorization Online

2012-02-23

arxiv.org/abs/1202.5233v1

Computer Science

Data Structures and Algorithms

Scientific paper

We present an algorithm which computes the Lempel-Ziv factorization of a word
W of length n online in the following sense: it reads W starting from the left,
and, after reading each r = O(log n) characters of W, updates the Lempel-Ziv
factorization. The algorithm requires O(n) bits of space and O(n log^2 n) time.
The basis of the algorithm is a sparse suffix tree combined with wavelet trees.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-660688