DAWG versus Suffix Array

摘要

This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array and the second is the Directed Acyclic Word Graph (DAWG). We present an efficient DAWG implementation. This implementation is compared with other structures used for text indexing. The construction time and speed of searching of a set of substrings are shown for the DAWG and the Suffix Array.