On Compact Directed Acyclic Word Graphs

Maxime Crochemore (1) , Renaud Vérin (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

The Directed Acyclic Word Graph (DAWG) is a space-efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet. Our implementation requires half the memory space used by DAWGs.

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Renaud Vérin. On Compact Directed Acyclic Word Graphs. Mycielski J., Rozenberg G., Salomaa A. Structures in Logic and Computer Science, 1261, Springer-Verlag, pp.192-211, 1997, LNCS. ⟨hal-00620801⟩