On Compact Directed Acyclic Word Graphs - Archive ouverte HAL Access content directly
Book Sections Year : 1997

On Compact Directed Acyclic Word Graphs


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.
Fichier principal
Vignette du fichier
9703-CSA.pdf (424.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620801 , version 1 (13-02-2013)


  • HAL Id : hal-00620801 , version 1


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⟩
153 View
790 Download


Gmail Facebook Twitter LinkedIn More