Abstract
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 language | English |
|---|---|
| Article number | 5 |
| Pages (from-to) | 721-730 |
| Number of pages | 10 |
| Journal | Computer Journal |
| Volume | 64 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 May 2021 |