Ternary directed acyclic word graphs

Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara

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

3 引用 (Scopus)

抄録

Given a set S of strings, a DFA accepting 5 offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists.

元の言語英語
ページ(範囲)97-111
ページ数15
ジャーナルTheoretical Computer Science
328
発行部数1-2
DOI
出版物ステータス出版済み - 11 29 2004

Fingerprint

Pattern matching
Ternary
Data structures
Graph in graph theory
Experiments
Binary search
Strings
Suffix
Implant
Pattern Matching
Matching Problem
Tree Structure
Efficient Solution
Linear Space
Data Structures
Trade-offs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Ternary directed acyclic word graphs. / Miyamoto, Satoru; Inenaga, Shunsuke; Takeda, Masayuki; Shinohara, Ayumi.

:: Theoretical Computer Science, 巻 328, 番号 1-2, 29.11.2004, p. 97-111.

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

Miyamoto, Satoru ; Inenaga, Shunsuke ; Takeda, Masayuki ; Shinohara, Ayumi. / Ternary directed acyclic word graphs. :: Theoretical Computer Science. 2004 ; 巻 328, 番号 1-2. pp. 97-111.
@article{003bf3bb9a2c43319c1708b7c2e1fc07,
title = "Ternary directed acyclic word graphs",
abstract = "Given a set S of strings, a DFA accepting 5 offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists.",
author = "Satoru Miyamoto and Shunsuke Inenaga and Masayuki Takeda and Ayumi Shinohara",
year = "2004",
month = "11",
day = "29",
doi = "10.1016/j.tcs.2004.07.008",
language = "English",
volume = "328",
pages = "97--111",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Ternary directed acyclic word graphs

AU - Miyamoto, Satoru

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

AU - Shinohara, Ayumi

PY - 2004/11/29

Y1 - 2004/11/29

N2 - Given a set S of strings, a DFA accepting 5 offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists.

AB - Given a set S of strings, a DFA accepting 5 offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists.

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

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

U2 - 10.1016/j.tcs.2004.07.008

DO - 10.1016/j.tcs.2004.07.008

M3 - Article

VL - 328

SP - 97

EP - 111

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -