Login / Signup
Computing Longest Common Substrings Via Suffix Arrays.
Maxim A. Babenko
Tatiana Starikovskaya
Published in:
CSR (2008)
Keyphrases
</>
suffix array
suffix tree
data structure
space efficient
similarity measurement
data compression
string matching
sequence analysis
pattern matching
space requirements
indexing structure
text retrieval
inverted file
database
co occurrence
dimensionality reduction
high dimensional