Space-economical construction of index structures for all suffixes of a string

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa

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

4 引用 (Scopus)

抜粋

The minimum all-suffixes directed acyclic word graph (MASDAWG) of a string w has |w| + 1 initial nodes, where the dag induced by all reachable nodes from the k-th initial node conforms with the DAWG of the k-th suffix of w. A new space-economical algorithm for the construction of MASDAWG(w) is presented. The algorithm reads a given string w from right to left, and constructs MASDAWG(w) without suffix links. It performs in time linear in the output size. Furthermore, we introduce the minimum all-suffixes compact DAWG (MASCDAWG). CDAWGs are known to be more space-economical than DAWGs, and thus MASCDAWG(w) requires smaller space than MASDAWG(w). We present an on-line (right-to-left) algorithm to build MASCDAWG(w) without suffix links, whose running time is also linear in its size.

元の言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
編集者Krzysztof Diks, Wojciech Rytter, Wojciech Rytter
出版者Springer Verlag
ページ341-352
ページ数12
ISBN(印刷物)3540440402, 9783540440406
DOI
出版物ステータス出版済み - 1 1 2002
イベント27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, ポーランド
継続期間: 8 26 20028 30 2002

出版物シリーズ

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

その他

その他27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002
ポーランド
Warsaw
期間8/26/028/30/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Space-economical construction of index structures for all suffixes of a string' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Inenaga, S., Shinohara, A., Takeda, M., Bannai, H., & Arikawa, S. (2002). Space-economical construction of index structures for all suffixes of a string. : K. Diks, W. Rytter, & W. Rytter (版), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings (pp. 341-352). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2420). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_28