On-Line Construction of Compact Directed Acyclic Word Graphs

Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient variant of DAWG. Crochemore and V´erin gave the first direct algorithm to construct CDAWGs from given strings, based on the McCreight’s algorithm for suffix trees. In this paper, we give an Ukkonen’s counterpart for CDAWGs. That is, we show an on-line algorithm that constructs CDAWGs from given strings directly.

• Type: Conference
• Year: 2001
• Where: CPM
• Authors: Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
• Keywords: Combinatorics, CPM 2001, Directed Acyclic Word Graph, Space Efficient Data, first Direct Algorithm