On-line construction of compact directed acyclic word graphs

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi

研究成果: Article査読

31 被引用数 (Scopus)

抄録

Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compact directed acyclic word graphs (CDAWGs) are an index structure preserving some features of both suffix trees and DAWGs, and require less space than both of them. An algorithm which directly constructs CDAWGs in linear time and space was first introduced by Crochemore and Vérin, based on McCreight's algorithm for constructing suffix trees. In this work, we present a novel on-line linear-time algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's on-line algorithm for constructing suffix trees.

本文言語English
ページ(範囲)156-179
ページ数24
ジャーナルDiscrete Applied Mathematics
146
2
DOI
出版ステータスPublished - 2005 3月 1
外部発表はい

ASJC Scopus subject areas

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「On-line construction of compact directed acyclic word graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル