On-line construction of compact directed acyclic word graphs

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi

研究成果: Conference contribution

23 被引用数 (Scopus)

抄録

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm for its construction, as well as the construction of a CDAWG for a set of strings.

本文言語English
ホスト出版物のタイトルCombinatorial Pattern Matching - 12th Annual Symposium, CPM 2001, Proceedings
編集者Amihood Amir, Amihood Amir, Gad M. Landau, Gad M. Landau
出版社Springer Verlag
ページ169-180
ページ数12
ISBN(印刷版)3540422714, 9783540422716
DOI
出版ステータスPublished - 2001
外部発表はい
イベント12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001 - Jerusalem, Israel
継続期間: 2001 7 12001 7 4

出版物シリーズ

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

Other

Other12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001
国/地域Israel
CityJerusalem
Period01/7/101/7/4

ASJC Scopus subject areas

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

フィンガープリント

「On-line construction of compact directed acyclic word graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル