Fibonacci based compressed suffix array

Ekaterina Benza, Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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 languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2018
EditorsJan Holub, Jan Zdarek
PublisherPrague Stringology Club
Number of pages9
ISBN (Electronic)9788001064849
StatePublished - 2018
Event22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic
Duration: 27 Aug 201828 Aug 2018

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2018


Conference22nd Prague Stringology Conference, PSC 2018
Country/TerritoryCzech Republic

Bibliographical note

Publisher Copyright:
© Proceedings of the Prague Stringology Conference, PSC 2018. All rights reserved.


Dive into the research topics of 'Fibonacci based compressed suffix array'. Together they form a unique fingerprint.

Cite this