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

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

研究成果: Conference contribution

5 被引用数 (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.

本文言語English
ホスト出版物のタイトルCombinatorial Pattern Matching - 13th Annual Symposium, CPM 2002, Proceedings
編集者Alberto Apostolico, Masayuki Takeda
出版社Springer-Verlag
ページ153-167
ページ数15
ISBN(電子版)9783540438625
出版ステータスPublished - 2002 1 1
外部発表はい
イベント13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002 - Fukuoka, Japan
継続期間: 2002 7 32002 7 5

出版物シリーズ

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

Other

Other13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002
国/地域Japan
CityFukuoka
Period02/7/302/7/5

ASJC Scopus subject areas

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

フィンガープリント

「The minimum DAWG for all suffixes of a string and its applications」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル