On the implementation of compact DAWG's

Authors:
Jan Holub;Maxime Crochemore
Affiliations:
Department of Computer Science and Engineering, Czech Technical University, Czech Republic;Gaspard-Monge Institute, University of Marne-la-Vallée, France
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 8
Cited 4

Transducers and repetitions

Theoretical Computer Science
Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
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
Reducing the space requirement of suffix trees

Software—Practice & Experience
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
Direct Construction of Compact Directed Acyclic Word Graphs

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching

Computing all repeats using suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
On Sturmian graphs

Discrete Applied Mathematics
On-line construction of compact suffix vectors and maximal repeats

Theoretical Computer Science
Sturmian graphs and a conjecture of moser

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are several data structures that allow searching for a pattern P in a preprocessed text T in time dependent just on the length of P. In this paper we present an implementation of CDAWG's-- Compact Direct Acyclic Word Graphs. While the previous implementations of CDAWG's required from 7n to 23n bytes of memory space, ours achieves 1.7n to 5n for a text T of length n. The implementation is suitable for large data files, since it minimizes the number of disk accesses. If disk accesses are not to be optimized, space requirements can be further decreased.