Lempel-Ziv factorization using less time & space
For 30 years the Lempel-Ziv factorization LZ x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) in x. Traditionally the standard method for computing LZ x was based on T(n)-time...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Birkhauser
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/45235 |