Shortest Unique Substrings Queries in Optimal Time
- Cite this paper as:
- Tsuruta K., Inenaga S., Bannai H., Takeda M. (2014) Shortest Unique Substrings Queries in Optimal Time. In: Geffert V., Preneel B., Rovan B., Štuller J., Tjoa A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham
We present an optimal, linear time algorithm for the shortest unique substring problem, thus improving the algorithm by Pei et al. (ICDE 2013). Our implementation is simple and based on suffix arrays. Computational experiments show that our algorithm is much more efficient in practice, compared to that of Pei et al.
Unable to display preview. Download preview PDF.