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

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Citations (Scopus)

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.

Original language	English
Title of host publication	String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings
Editors	Alberto H. F. Laender, Arlindo L. Oliveira
Publisher	Springer Verlag
Pages	310-324
Number of pages	15
ISBN (Print)	3540441581, 9783540441588
DOIs	https://doi.org/10.1007/3-540-45735-6_27
Publication status	Published - 2002
Event	9th International Symposium on String Processing and Information Retrieval, SPIRE 2002 - Lisbon, Portugal Duration: 2002 Sept 11 → 2002 Sept 13

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2476
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Symposium on String Processing and Information Retrieval, SPIRE 2002
Country/Territory	Portugal
City	Lisbon
Period	02/9/11 → 02/9/13

Access to Document

10.1007/3-540-45735-6_27

Cite this

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

Inenaga, Shunsuke ; Shinohara, Ayumi ; Takeda, Masayuki et al. / 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{7bff87967ee042c08814b6387f9e38a4,

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",

}

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, Portugal, 02/9/11. 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 et al.
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).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Compact directed acyclic word graphs for a sliding window

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Arikawa, Setsuo

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

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 -

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

Compact directed acyclic word graphs for a sliding window

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this