2003 | OriginalPaper | Buchkapitel
DAWG versus Suffix Array
verfasst von : Miroslav Balík
Erschienen in: Implementation and Application of Automata
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 eficient 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.