TY  -  
T1  - Compressed Spaced Suffix Arrays 
SN  -  /  
UR  - http://hdl.handle.net/10138/312475 
T3  -  
A1  - Gagie, Travis; Manzini, Giovanni; Valenzuela, Daniel 
A2  -  
PB  -  
Y1  - 2017 
LA  - eng 
AB  - 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... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - 111 Mathematics; 113 Computer and information sciences 
N1  -   
PP  -  
ER  -