Sparse compact directed acyclic word graphs

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

4 被引用数 (Scopus)

抄録

The suffix tree of string w represents all suffixes of w, and thus it supports full indexing of w for exact pattern matching. On the other hand, a sparse suffix tree of w represents only a subset of the suffixes of w, and therefore it supports sparse indexing of w. There has been a wide range of applications of sparse suffix trees, e.g., natural language processing and biological sequence analysis. Word suffix trees are a variant of sparse suffix trees that are defined for strings that contain a special word delimiter #. Namely, the word suffix tree of string w = w 1w 2 · · ·w k, consisting of k words each ending with #, represents only the k suffixes of w of the form w i · · ·w k. Recently, we presented an algorithm which builds word suffix trees in O(n) time with O(k) space, where n is the length of w. In addition, we proposed sparse directed acyclic word graphs (SDAWGs) and an on-line algorithm for constructing them, working in O(n) time and space. As a further achievement of this research direction, this paper introduces yet a new text indexing structure named sparse compact directed acyclic word graphs (SCDAWGs). We show that the size of SCDAWGs is smaller than that of word suffix trees and SDAWGs, and present an SCDAWG construction algorithm that works in O(n) time with O(k) space and in an on-line manner.

本文言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference '06
ページ197-211
ページ数15
出版ステータス出版済み - 12 1 2006
イベントPrague Stringology Conference '06, PSC 2006 - Prague, チェコ共和国
継続期間: 8 28 20068 30 2006

出版物シリーズ

名前Proceedings of the Prague Stringology Conference '06

その他

その他Prague Stringology Conference '06, PSC 2006
Countryチェコ共和国
CityPrague
Period8/28/068/30/06

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

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

引用スタイル