论文信息 - Construction of the CDAWG for a Trie

Construction of the CDAWG for a Trie

Trie is a tree structure to represent a set of strings. When the strings have many common prefixes, the number of nodes in the trie is much less than the total length of the strings. In this paper, we propose an algorithm for constructing the Compact Directed Acyclic Word Graph for a trie, which runs in linear time and space with respect to the number of nodes in the trie.

Ayumi Shinohara | Setsuo Arikawa | Shunsuke Inenaga | Masayuki Takeda | Hiromasa Hoshino

[1] M. Crochemore,et al. On-line construction of suffix trees , 2002 .

[2] Dany Breslauer. The suffix Tree of a Tree and Minimizing Sequential Transducers , 1996, CPM.

[3] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[4] David Haussler,et al. The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[5] David Haussler,et al. Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[6] Maxime Crochemore,et al. On Compact Directed Acyclic Word Graphs , 1997, Structures in Logic and Computer Science.

[7] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .