Abstract
We propose Fibonacci based compressed suffix arrays, and show how repeated decompression can be avoided using our scheme. For a given file T of size n, the implementation requires 1.44 nHk + n + o(n) bits of space, where Hk is the k-th order empirical entropy of T, while retaining the searching functionalities. Empirical results support this theoretical bound improvement, and show that on most files, our implementation saves space as compared to previous suggestions.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Prague Stringology Conference, PSC 2018 |
| Editors | Jan Holub, Jan Zdarek |
| Publisher | Prague Stringology Club |
| Pages | 3-11 |
| Number of pages | 9 |
| ISBN (Electronic) | 9788001064849 |
| State | Published - 2018 |
| Event | 22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic Duration: 27 Aug 2018 → 28 Aug 2018 |
Publication series
| Name | Proceedings of the Prague Stringology Conference, PSC 2018 |
|---|
Conference
| Conference | 22nd Prague Stringology Conference, PSC 2018 |
|---|---|
| Country/Territory | Czech Republic |
| City | Prague |
| Period | 27/08/18 → 28/08/18 |
Bibliographical note
Publisher Copyright:© Proceedings of the Prague Stringology Conference, PSC 2018. All rights reserved.