On-line construction of symmetric compact directed acyclic word graphs

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

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

5 Citations (Scopus)

Abstract

The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a string w is a dual structure that supports indices of both w and the reverse of w simultaneously. Blumer et al. gave the first algorithm to construct an SCDAWG from a given string, that works in an off-line manner. In this paper, we show an on-line algorithm that constructs an SCDAWG from a given string directly.

Original languageEnglish
Title of host publicationProceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages96-110
Number of pages15
ISBN (Electronic)0769511929, 9780769511924
DOIs
Publication statusPublished - Jan 1 2001
Event8th Symposium on String Processing and Information Retrieval, SPIRE 2001 - Laguna de San Rafael, Chile
Duration: Nov 13 2001Nov 15 2001

Publication series

NameProceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001

Other

Other8th Symposium on String Processing and Information Retrieval, SPIRE 2001
CountryChile
CityLaguna de San Rafael
Period11/13/0111/15/01

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this

Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., & Arikawa, S. (2001). On-line construction of symmetric compact directed acyclic word graphs. In Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001 (pp. 96-110). [989743] (Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPIRE.2001.989743