@inproceedings{108cb1326cde4de1bec57fe0ff262195,
title = "Computing DAWGs and minimal absent words in linear time for integer alphabets",
abstract = "The directed acyclic word graph (DAWG) of a string y is the smallest (partial) DFA which recognizes all suffixes of y and has only O(n) nodes and edges. We present the first O(n)-time algorithm for computing the DAWG of a given string y of length n over an integer alphabet of polynomial size in n. We also show that a straightforward modification to our DAWG construction algorithm leads to the first O(n)-time algorithm for constructing the affix tree of a given string y over an integer alphabet. Affix trees are a text indexing structure supporting bidirectional pattern searches. As an application to our O(n)-time DAWG construction algorithm, we show that the set MAW(y) of all minimal absent words of y can be computed in optimal O(n +MAW(y)) time and O(n) working space for integer alphabets.",
author = "Yuta Fujishige and Yuki Tsujimaru and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2016",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.MFCS.2016.38",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Anca Muscholl and Piotr Faliszewski and Rolf Niedermeier",
booktitle = "41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016",
note = "41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 ; Conference date: 22-08-2016 Through 26-08-2016",
}