Sparse directed acyclic word graphs

Shunsuke Inenaga, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 13th International Conference, SPIRE 2006, Proceedings
PublisherSpringer Verlag
Number of pages13
ISBN (Print)3540457747, 9783540457749
Publication statusPublished - 2006
Event13th International Conference on String Processing and Information Retrieval, SPIRE 2006 - Glasgow, United Kingdom
Duration: Oct 11 2006Oct 13 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4209 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other13th International Conference on String Processing and Information Retrieval, SPIRE 2006
Country/TerritoryUnited Kingdom

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Sparse directed acyclic word graphs'. Together they form a unique fingerprint.

Cite this