Name
Abstract | ||
|---|---|---|
We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d >= 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to lightweight LZ77 factorization. Extensive experiments show that the new algorithm is superior in most cases, particularly at the lowest memory levels and for highly repetitive data. As a part of the algorithm, we describe new methods for computing matching statistics which may be of independent interest. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38527-8_14 | SEA |
DocType | Volume | Citations |
Journal | abs/1302.1064 | 17 |
PageRank | References | Authors |
0.72 | 28 | 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 |