Shortest unique substrings queries in optimal time

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSOFSEM 2014
Subtitle of host publicationTheory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages503-513
Number of pages11
ISBN (Print)9783319042978
DOIs
Publication statusPublished - Jan 1 2014
Event40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 - Novy Smokovec, Slovakia
Duration: Jan 26 2014Jan 29 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8327 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014
CountrySlovakia
CityNovy Smokovec
Period1/26/141/29/14

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tsuruta, K., Inenaga, S., Bannai, H., & Takeda, M. (2014). Shortest unique substrings queries in optimal time. In SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 503-513). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8327 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_44