Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays.

Dominik Kempa Tomasz Kociumaka

Published in: CoRR (2021)

Keyphrases

compression algorithm
suffix array
data compression
data structure
suffix tree
space efficient
string matching
similarity measurement
dynamic programming
pattern matching
knn