Compact directed acyclic word graphs for a sliding window

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

研究成果: ジャーナルへの寄稿記事

7 引用 (Scopus)

抄録

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

元の言語英語
ページ(範囲)33-51
ページ数19
ジャーナルJournal of Discrete Algorithms
2
発行部数1 SPEC. ISS.
DOI
出版物ステータス出版済み - 1 1 2004

Fingerprint

Suffix Tree
Sliding Window
Data structures
Data Structures
Data compression
Graph in graph theory
Strings
String Matching
Data Compression
Linear-time Algorithm
Indexing
Efficient Algorithms
Denote
Partial
Prediction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

これを引用

Compact directed acyclic word graphs for a sliding window. / Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo.

:: Journal of Discrete Algorithms, 巻 2, 番号 1 SPEC. ISS., 01.01.2004, p. 33-51.

研究成果: ジャーナルへの寄稿記事

Inenaga, Shunsuke ; Shinohara, Ayumi ; Takeda, Masayuki ; Arikawa, Setsuo. / Compact directed acyclic word graphs for a sliding window. :: Journal of Discrete Algorithms. 2004 ; 巻 2, 番号 1 SPEC. ISS. pp. 33-51.
@article{2c5c8b9b764543af987be6ef2c9a7153,
title = "Compact directed acyclic word graphs for a sliding window",
abstract = "Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string ω can be constructed in O(n) time and space, where n denotes the length of ω. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window.",
author = "Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa",
year = "2004",
month = "1",
day = "1",
doi = "10.1016/S1570-8667(03)00064-9",
language = "English",
volume = "2",
pages = "33--51",
journal = "Journal of Discrete Algorithms",
issn = "1570-8667",
publisher = "Elsevier",
number = "1 SPEC. ISS.",

}

TY - JOUR

T1 - Compact directed acyclic word graphs for a sliding window

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Arikawa, Setsuo

PY - 2004/1/1

Y1 - 2004/1/1

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

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

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

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

U2 - 10.1016/S1570-8667(03)00064-9

DO - 10.1016/S1570-8667(03)00064-9

M3 - Article

AN - SCOPUS:10644222716

VL - 2

SP - 33

EP - 51

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

SN - 1570-8667

IS - 1 SPEC. ISS.

ER -