Compact directed acyclic word graphs for a sliding window

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

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

5 Citations (Scopus)

Abstract

The suffix tree is a well-known and widely-studied data structure that is highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain a suffix tree for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. The compact directed acyclic word graph (CDAWG) is a more space-economical data structure for indexing a string. In this paper we propose a linear-time algorithm to maintain a CDAWG for a sliding window.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings
EditorsAlberto H. F. Laender, Arlindo L. Oliveira
PublisherSpringer Verlag
Pages310-324
Number of pages15
ISBN (Print)3540441581, 9783540441588
DOIs
Publication statusPublished - Jan 1 2002
Event9th International Symposium on String Processing and Information Retrieval, SPIRE 2002 - Lisbon, Portugal
Duration: Sep 11 2002Sep 13 2002

Publication series

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

Other

Other9th International Symposium on String Processing and Information Retrieval, SPIRE 2002
CountryPortugal
CityLisbon
Period9/11/029/13/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Compact directed acyclic word graphs for a sliding window'. Together they form a unique fingerprint.

Cite this