Abstract
As a first step in designing relatively-compressed data structures—i.e., such that storing an instance for one dataset helps us store instances for similar datasets—we consider how to compress spaced suffix arrays relative to normal suffix arrays and still support fast access to them. This problem is of practical interest when performing similarity search with spaced seeds because using several seeds in parallel significantly improves their performance, but with existing approaches we keep a separate linear-space hash table or spaced suffix array for each seed. We first prove a theoretical upper bound on the space needed to store a spaced suffix array when we already have the suffix array. We then present experiments indicating that our approach works even better in practice.
Lingua originale | Inglese |
---|---|
pagine (da-a) | 151-157 |
Numero di pagine | 7 |
Rivista | Mathematics in Computer Science |
Volume | 11 |
Numero di pubblicazione | 2 |
DOI | |
Stato di pubblicazione | Pubblicato - 1 giu 2017 |
Pubblicato esternamente | Sì |