Time-space trade-offs for compressed suffix arrays.

DOI10.1016/S0020-0190(01)00298-8zbMath1051.68048OpenAlexW2088362495MaRDI QIDQ1853020

S. Srinivasa Rao

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00298-8

zbMATH Keywords

Data structuresSuffix arraySuffix tree

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Ultra-succinct representation of ordered trees with applications ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ Locally Compressed Suffix Arrays ⋮ Improved and extended locating functionality on compressed suffix arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space Efficient Suffix Trees
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• A universal algorithm for sequential data compression
• Efficient Storage and Retrieval by Content and Address of Static Files