Shortest unique substrings queries in optimal time

Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

20 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルSOFSEM 2014
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
出版者Springer Verlag
ページ503-513
ページ数11
ISBN(印刷物)9783319042978
DOI
出版物ステータス出版済み - 1 1 2014
イベント40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 - Novy Smokovec, スロバキア
継続期間: 1 26 20141 29 2014

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8327 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014
スロバキア
Novy Smokovec
期間1/26/141/29/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Shortest unique substrings queries in optimal time' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Tsuruta, K., Inenaga, S., Bannai, H., & Takeda, M. (2014). Shortest unique substrings queries in optimal time. : 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); 巻数 8327 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_44