Compact directed acyclic word graphs for a sliding window

Authors:
Shunsuke Inenaga;Ayumi Shinohara;Masayuki Takeda;Setsuo Arikawa
Affiliations:
Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan and PRESTO, Japan Science and Technology Corporation (JST), Japan;Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan and PRESTO, Japan Science and Technology Corporation (JST), Japan;Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan and PRESTO, Japan Science and Technology Corporation (JST), Japan;Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan
Venue:
Journal of Discrete Algorithms - SPIRE 2002
Year:
2004

Citing 12
Cited 4

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Data compression with finite windows

Communications of the ACM
Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Space-Economical Construction of Index Structures for All Suffixes of a String

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Compact Directed Acyclic Word Graphs

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Compact Directed Acyclic Word Graphs for a Sliding Window

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
On-Line Construction of Compact Directed Acyclic Word Graphs

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Extended application of suffix trees to data compression

DCC '96 Proceedings of the Conference on Data Compression
Bidirectional construction of suffix trees

Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Unbounded length contexts for PPM

DCC '95 Proceedings of the Conference on Data Compression

Sliding CDAWG Perfection

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the Structure of Consistent Partitions of Substring Set of a Word

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Suffix tree based data compression

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On-line suffix tree construction with reduced branching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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