Time-space trade-offs for compressed suffix arrays

Information Processing Letters

Volumn 82, Issue 6, 2002, Pages 307-311

  Rao, S Srinivasa ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Data structures; Suffix array; Suffix tree

Indexed keywords

ARRAYS; DATA STRUCTURES; DATABASE SYSTEMS; TREES (MATHEMATICS);

COMPRESSED SUFFIX ARRAYS;

DATA COMPRESSION;

EID: 0037199007     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00298-8     Document Type: Article

References (13)

1. A linear lower bound on index size for text retrieval
2. Efficient storage retrieval by content and address of static files
3. Opportunistic data structures with applications
4. An experimental study of an opportunistic index
5. Compressed suffix arrays and suffix trees with applications to text indexing and string matching
6. Compact suffix array
7. Suffix arrays: A new method for on-line string searches
8. Tables
9. Space efficient suffix trees
10. Compressed text databases with efficient query algorithms based on the compressed suffix array
11. A universal algorithm for sequential data compression