Shortest unique substring query revisited
Author
Ileri, Atalay Mert
Külekci, M.O.
Xu, B.
Date
2014Source Title
Combinatorial Pattern Matching
Print ISSN
0302-9743
Publisher
Springer, Cham
Volume
8486
Pages
172 - 181
Language
English
Type
Conference PaperItem Usage Stats
165
views
views
884
downloads
downloads
Abstract
We revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (ICDE'13). We propose an optimal O(n) time and space algorithm that can find an SUS for every location of a string of size n and thus significantly improve their O(n 2) time complexity. Our method also supports finding all the SUSes covering every location, whereas theirs can find only one SUS for every location. Further, our solution is simpler and easier to implement and can also be more space efficient in practice, since we only use the inverse suffix array and the longest common prefix array of the string, while their algorithm uses the suffix tree of the string and other auxiliary data structures. Our theoretical results are validated by an empirical study that shows our method is much faster and more space-saving. © 2014 Springer International Publishing Switzerland.
Keywords
Pattern matchingAuxiliary data structures
Empirical studies
Longest common prefixes
Space efficient
Substring
Time and space algorithms
Trees (mathematics)
Permalink
http://hdl.handle.net/11693/27552Published Version (Please cite this version)
https://doi.org/10.1007/978-3-319-07566-2_18https://doi.org/10.1007/978-3-319-07566-2