Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/comjnl/bxaa016 | The Computer Journal |
DocType | Volume | Issue |
Journal | 64 | 1 |
ISSN | Citations | PageRank |
0010-4620 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ekaterina Benza | 1 | 0 | 0.34 |
| Shmuel T. Klein | 2 | 434 | 77.80 |
| Dana Shapira | 3 | 144 | 32.15 |