Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: 著書/レポートタイプへの貢献会議での発言

抜粋

We present the first worst-case linear time algorithm that directly computes the parameterized suffix and LCP arrays for constant sized alphabets. Previous algorithms either required quadratic time or the parameterized suffix tree to be built first. More formally, for a string over static alphabet and parameterized alphabet, our algorithm runs in time and O(n) words of space, where is the number of distinct symbols of in the string.

元の言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings
編集者Nieves R. Brisaboa, Simon J. Puglisi
出版者Springer
ページ382-391
ページ数10
ISBN(印刷物)9783030326852
DOI
出版物ステータス出版済み - 1 1 2019
イベント26th International Symposium on String Processing and Information Retrieval, SPIRE 2019 - Segovia, スペイン
継続期間: 10 7 201910 9 2019

出版物シリーズ

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

会議

会議26th International Symposium on String Processing and Information Retrieval, SPIRE 2019
スペイン
Segovia
期間10/7/1910/9/19

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. : N. R. Brisaboa, & S. J. Puglisi (版), String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings (pp. 382-391). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11811 LNCS). Springer. https://doi.org/10.1007/978-3-030-32686-9_27