Sparse Directed Acyclic Word Graphs

摘要

The suffix tree of string w is a text indexing structure that represents all suffixes of ω. A sparse suffix tree of ω represents only a subset of suffixes of ω. An application to sparse suffix trees is composite pattern discovery from biological sequences. In this paper, we introduce a new data structure named sparse directed acyclic word graphs (SDAWGs), which are a sparse text indexing version of directed acyclic word graphs (DAWGs) of Blumer et al. We show that the size of SDAWGs is linear in the length of ω, and present an on-line linear-time construction algorithm for SDAWGs.