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
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)
Combinatorial Algorithms on Words
Combinatorial Algorithms on Words
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
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
Unbounded length contexts for PPM
DCC '95 Proceedings of the Conference on Data Compression
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms - SPIRE 2002
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.