The minimum DAWG for all suffixes of a string and its applications

Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa

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

4 引用 (Scopus)

抜粋

For a string w over an alphabet Σ, we consider a composite data structure called the all-suffixes directed acyclic word graph (ASDAWG). ASDAWG (w) has |w| + 1 initial nodes, and the dag induced by all reachable nodes from the k-th initial node conforms with DAWG(w[k :]), where w[k :] denotes the k-th suffix of w. We prove that the size of the minimum ASDAWG(w) (MASDAWG(w)) is Θ(|w|2) for |Σ| = 1, and is Θ(|w|) for |Σ| ≥ 2. Moreover, we introduce an on-line algorithm which directly constructs MASDAWG(w) for given w, whose running time is linear with respect to its size. We also demonstrate some application problems, beginning-sensitive pattern matching, region-sensitive pattern matching, and VLDC-pattern matching, for which AS-DAWGs are useful.

元の言語英語
ホスト出版物のタイトルCombinatorial Pattern Matching - 13th Annual Symposium, CPM 2002, Proceedings
編集者Alberto Apostolico, Masayuki Takeda
出版者Springer Verlag
ページ153-167
ページ数15
ISBN(電子版)9783540438625
DOI
出版物ステータス出版済み - 2002
イベント13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002 - Fukuoka, 日本
継続期間: 7 3 20027 5 2002

出版物シリーズ

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

その他

その他13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002
日本
Fukuoka
期間7/3/027/5/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント The minimum DAWG for all suffixes of a string and its applications' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Inenaga, S., Takeda, M., Shinohara, A., Hoshino, H., & Arikawa, S. (2002). The minimum DAWG for all suffixes of a string and its applications. : A. Apostolico, & M. Takeda (版), Combinatorial Pattern Matching - 13th Annual Symposium, CPM 2002, Proceedings (pp. 153-167). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2373). Springer Verlag. https://doi.org/10.1007/3-540-45452-7_14