Time-space trade-offs for compressed suffix arrays.
type: Item
instance of: scholarly article
title: Time-space trade-offs for compressed suffix arrays.
zbMATH Open document ID: 1051.68048
DOI: 10.1016/S0020-0190(01)00298-8
author: S. Srinivasa Rao
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1856365
zbMATH Keywords: Data structures
zbMATH Keywords: Suffix array
zbMATH Keywords: Suffix tree
MaRDI profile type: Publication
cites work: A linear lower bound on index size for text retrieval
cites work: Efficient Storage and Retrieval by Content and Address of Static Files
cites work: An experimental study of an opportunistic index
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Q2723961
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Space efficient suffix trees
cites work: Q4472515
cites work: A universal algorithm for sequential data compression
full work available at URL: s0020-0190(01)00298-8
OpenAlex ID: W2088362495
description: scientific article; zbMATH DE number 1856365