Chapter

SOFSEM 2014: Theory and Practice of Computer Science

Volume 8327 of the series Lecture Notes in Computer Science pp 503-513

Shortest Unique Substrings Queries in Optimal Time

  • Kazuya TsurutaAffiliated withDepartment of Informatics, Kyushu University
  • , Shunsuke InenagaAffiliated withDepartment of Informatics, Kyushu University
  • , Hideo BannaiAffiliated withDepartment of Informatics, Kyushu University
  • , Masayuki TakedaAffiliated withDepartment of Informatics, Kyushu University

* Final gross prices may vary according to local VAT.

Get Access

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.