Shortest Unique Substrings Queries in Optimal Time

  • Kazuya Tsuruta
  • Shunsuke Inenaga
  • Hideo Bannai
  • Masayuki Takeda
Conference paper

DOI: 10.1007/978-3-319-04298-5_44

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8327)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Kazuya Tsuruta
    • 1
  • Shunsuke Inenaga
    • 1
  • Hideo Bannai
    • 1
  • Masayuki Takeda
    • 1
  1. 1.Department of InformaticsKyushu UniversityJapan

Personalised recommendations