Name
Abstract | ||
|---|---|---|
Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization algorithms, some of which require only 2n log n + O(log n) bits of working space to factorize a string of length n. These are the most space efficient linear time algorithms to date, using n log n bits less space than any previous linear time algorithm. The algorithms are also simple to implement, very fast in practice, and amenable to streaming implementation. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38905-4_19 | COMBINATORIAL PATTERN MATCHING |
DocType | Volume | ISSN |
Conference | 7922 | 0302-9743 |
Citations | PageRank | References |
19 | 1.11 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juha Kärkkäinen | 1 | 1354 | 95.20 |
| Dominik Kempa | 2 | 142 | 16.37 |
| Simon J. Puglisi | 3 | 1132 | 75.14 |