论文信息 - On the implementation of compact DAWG's

On the implementation of compact DAWG's

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.

Maxime Crochemore | Jan Holub

[1] David Haussler,et al. Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[2] Miroslav Balík. Implementation of DAWG , 1998, Stringology.

[3] Grzegorz Rozenberg,et al. Structures in Logic and Computer Science , 1997, Lecture Notes in Computer Science.

[4] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999 .

[5] Maxime Crochemore,et al. On Compact Directed Acyclic Word Graphs , 1997, Structures in Logic and Computer Science.

[6] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[7] Maxime Crochemore,et al. Algorithmique du texte , 2001 .

[8] David Haussler,et al. The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[9] Maxime Crochemore,et al. Transducers and Repetitions , 1986, Theor. Comput. Sci..

[10] Wojciech Rytter,et al. Text Algorithms , 1994 .

[11] Maxime Crochemore,et al. Direct Construction of Compact Directed Acyclic Word Graphs , 1997, CPM.