Smaller compressed suffix arrays

Ekaterina Benza, Shmuel T. Klein, Dana Shapira

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


An alternative to compressed suffix arrays is introduced, based on representing a sequence of integers using Fibonacci encodings, thereby reducing the space requirements of state-of-the-art implementations of the suffix array, while retaining the searching functionalities. Empirical tests support the theoretical space complexity improvements and show that there is no deterioration in the processing times.

Original languageEnglish
Article number5
Pages (from-to)721-730
Number of pages10
JournalComputer Journal
Issue number5
StatePublished - 1 May 2021


Dive into the research topics of 'Smaller compressed suffix arrays'. Together they form a unique fingerprint.

Cite this