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
出版ステータス出版済み - 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
国/地域ポーランド
CityWarsaw
Period8/26/028/30/02

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Space-economical construction of index structures for all suffixes of a string」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル