Abstract
The suffix tree of string w is a text indexing structure that represents all suffixes of w. A sparse suffix tree of w represents only a subset of suffixes of w. 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 w, and present an on-line linear-time construction algorithm for SDAWGs. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Inenaga, S., & Takeda, M. (2006). Sparse directed acyclic word graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 61–73). Springer Verlag. https://doi.org/10.1007/11880561_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
