Ternary directed acyclic word graphs

Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara

Research output: Contribution to journalArticlepeer-review

3 Citations (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.

Original languageEnglish
Pages (from-to)97-111
Number of pages15
JournalTheoretical Computer Science
Issue number1-2
Publication statusPublished - Nov 29 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Ternary directed acyclic word graphs'. Together they form a unique fingerprint.

Cite this