Sliding CDAWG Perfection

Authors:
Martin Senft;Tomáš Dvořák
Affiliations:
Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic;Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 6
Cited 1

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
How much is that DAWG in the window? A moving window algorithm for the directed acyclic word graph

Journal of Algorithms
Data compression with finite windows

Communications of the ACM
Compact directed acyclic word graphs for a sliding window

Journal of Discrete Algorithms - SPIRE 2002
Compressed by the Suffix Tree

DCC '06 Proceedings of the Data Compression Conference
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics

On-line suffix tree construction with reduced branching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Compact Directed Acyclic Word Graph (CDAWG) is a well-known suffix data structure designed for an efficient solution to problems on strings. Some applications, especially those from the data compression field, require maintaining a CDAWG over a sliding window. The fastest known solution to this problem is an approximation algorithm that slides a CDAWG in an amortized constant time. However, the existence of an exact algorithm performing within the same complexity bounds has been an open question so far. We show that the answer to this question is negative and present an on-line algorithm with the best asymptotic complexity possible.