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.
Author supplied keywords
Cite
CITATION STYLE
Crochemore, M., & Vérin, R. (1997). Direct construction of compact directed acyclic word graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1264, pp. 116–129). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
