Compact directed acyclic word graphs for a sliding window

Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa

doi:10.1007/3-540-45735-6_27

Compact directed acyclic word graphs for a sliding window

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

数理情報

研究成果: 書籍/レポートタイプへの寄稿 › 会議への寄与

5 被引用数 (Scopus)

抄録

The suffix tree is a well-known and widely-studied data structure that is highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain a suffix tree for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. The compact directed acyclic word graph (CDAWG) is a more space-economical data structure for indexing a string. In this paper we propose a linear-time algorithm to maintain a CDAWG for a sliding window.

本文言語	英語
ホスト出版物のタイトル	String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings
編集者	Alberto H. F. Laender, Arlindo L. Oliveira
出版社	Springer Verlag
ページ	310-324
ページ数	15
ISBN（印刷版）	3540441581, 9783540441588
DOI	https://doi.org/10.1007/3-540-45735-6_27
出版ステータス	出版済み - 2002
イベント	9th International Symposium on String Processing and Information Retrieval, SPIRE 2002 - Lisbon, ポルトガル継続期間: 9月 11 2002 → 9月 13 2002

出版物シリーズ

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

その他

その他	9th International Symposium on String Processing and Information Retrieval, SPIRE 2002
国/地域	ポルトガル
City	Lisbon
Period	9/11/02 → 9/13/02

!!!All Science Journal Classification (ASJC) codes

理論的コンピュータサイエンス
コンピュータサイエンス（全般）

文献へのアクセス

10.1007/3-540-45735-6_27

他のファイルとリンク

引用スタイル

Inenaga, S., Shinohara, A., Takeda, M., & Arikawa, S. (2002). Compact directed acyclic word graphs for a sliding window. In A. H. F. Laender, & A. L. Oliveira (Eds.), String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings (pp. 310-324). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2476). Springer Verlag. https://doi.org/10.1007/3-540-45735-6_27

Compact directed acyclic word graphs for a sliding window. / Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki その他.

String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. ed. / Alberto H. F. Laender; Arlindo L. Oliveira. Springer Verlag, 2002. p. 310-324 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2476).

研究成果: 書籍/レポートタイプへの寄稿 › 会議への寄与

Inenaga, S, Shinohara, A, Takeda, M & Arikawa, S 2002, Compact directed acyclic word graphs for a sliding window. in AHF Laender & AL Oliveira (eds), String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2476, Springer Verlag, pp. 310-324, 9th International Symposium on String Processing and Information Retrieval, SPIRE 2002, Lisbon, ポルトガル, 9/11/02. https://doi.org/10.1007/3-540-45735-6_27

Inenaga S, Shinohara A, Takeda M, Arikawa S. Compact directed acyclic word graphs for a sliding window. In Laender AHF, Oliveira AL, editors, String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. Springer Verlag. 2002. p. 310-324. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45735-6_27

Inenaga, Shunsuke ; Shinohara, Ayumi ; Takeda, Masayuki その他. / Compact directed acyclic word graphs for a sliding window. String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. editor / Alberto H. F. Laender ; Arlindo L. Oliveira. Springer Verlag, 2002. pp. 310-324 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f8ffa7a84e7b430495112200194902da,

title = "Compact directed acyclic word graphs for a sliding window",

abstract = "The suffix tree is a well-known and widely-studied data structure that is highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain a suffix tree for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. The compact directed acyclic word graph (CDAWG) is a more space-economical data structure for indexing a string. In this paper we propose a linear-time algorithm to maintain a CDAWG for a sliding window.",

author = "Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 9th International Symposium on String Processing and Information Retrieval, SPIRE 2002 ; Conference date: 11-09-2002 Through 13-09-2002",

year = "2002",

doi = "10.1007/3-540-45735-6_27",

language = "English",

isbn = "3540441581",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "310--324",

editor = "Laender, {Alberto H. F.} and Oliveira, {Arlindo L.}",

booktitle = "String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Compact directed acyclic word graphs for a sliding window

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Arikawa, Setsuo

PY - 2002

Y1 - 2002

N2 - The suffix tree is a well-known and widely-studied data structure that is highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain a suffix tree for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. The compact directed acyclic word graph (CDAWG) is a more space-economical data structure for indexing a string. In this paper we propose a linear-time algorithm to maintain a CDAWG for a sliding window.

AB - The suffix tree is a well-known and widely-studied data structure that is highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain a suffix tree for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. The compact directed acyclic word graph (CDAWG) is a more space-economical data structure for indexing a string. In this paper we propose a linear-time algorithm to maintain a CDAWG for a sliding window.

UR - http://www.scopus.com/inward/record.url?scp=84881080749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84881080749&partnerID=8YFLogxK

U2 - 10.1007/3-540-45735-6_27

DO - 10.1007/3-540-45735-6_27

M3 - Conference contribution

AN - SCOPUS:84881080749

SN - 3540441581

SN - 9783540441588

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 310

EP - 324

BT - String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings

A2 - Laender, Alberto H. F.

A2 - Oliveira, Arlindo L.

PB - Springer Verlag

T2 - 9th International Symposium on String Processing and Information Retrieval, SPIRE 2002

Y2 - 11 September 2002 through 13 September 2002

ER -

Compact directed acyclic word graphs for a sliding window

抄録

出版物シリーズ

その他

!!!All Science Journal Classification (ASJC) codes

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル