Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.

Published in: CPM (2005)

Keyphrases

suffix array
data structure
space requirements
space efficient
suffix tree
data compression
similarity measurement
string matching
worst case
inverted file
low dimensional
pattern matching
high dimensional
query processing
data management
sliding window
similarity metric
database