Direct construction of compact Directed Acyclic Word Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

Direct construction of compact Directed Acyclic Word Graphs

Abstract

The Directed Acyclic Word Graph (DAWG) is an 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
97-CPM.pdf (334.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-00620006 , version 1

Cite

Maxime Crochemore, Renaud Vérin. Direct construction of compact Directed Acyclic Word Graphs. Combinatorial Pattern Matching (Aarhus, 1997), 1997, France. pp.116-129. ⟨hal-00620006⟩
83 View
631 Download

Share

Gmail Facebook Twitter LinkedIn More