Abstract
The directed acyclic word graph (DAWG) of a string y is the smallest (partial) DFA which recognizes all suffixes of y and has O(n) nodes and edges. Na et al. [11] proposed k-truncated suffix tree which is a compressed trie that represents substrings of a string whose length up to k. In this paper, we present a new data structure called k-truncated DAWGs, which can be obtained by pruning the DAWGs. We show that the size complexity of the k-truncated DAWG of a string y of length n is \(O(\min \{n,kz\})\) which is equal to the truncated suffix tree’s one, where z is the size of LZ77 factorization of y. We also present an \(O(n\log \sigma )\) time and \(O(\min \{ n,kz\})\) space algorithm for constructing the k-truncated DAWG of y, where \(\sigma \) is the alphabet size. As an application of the truncated DAWGs, we show that the set \( MAW _k(y)\) of all minimal absent words of y whose length is smaller than or equal to k can be computed by using k-truncated DAWG of y in \(O(\min \{ n, kz\} + | MAW _k(y)|)\) time and \(O(\min \{ n,kz\})\) working space.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31–55 (1985)
Blumer, A., Blumer, J., Haussler, D., McConnell, R.M., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578–595 (1987)
Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450, 109–116 (2012). https://doi.org/10.1016/j.tcs.2012.04.031
Crochemore, M.: Transducers and repetitions. Theor. Comput. Sci. 45(1), 63–86 (1986)
Crochemore, M., Héliou, A., Kucherov, G., Mouchard, L., Pissis, S.P., Ramusat, Y.: Minimal absent words in a sliding window and applications to on-line pattern matching. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 164–176. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55751-8_14
Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Co., Pte. Ltd., Singapore (2002)
Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing DAWGs and minimal absent words in linear time for integer alphabets. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, 22–26 August 2016, Kraków, Poland, pp. 38:1–38:14 (2016). https://doi.org/10.4230/LIPIcs.MFCS.2016.38
Inenaga, S., et al.: On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. 146(2), 156–179 (2005)
Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935–948 (1993)
Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theor. Comput. Sci. 273(1–2), 99–117 (2002)
Na, J.C., Apostolico, A., Iliopoulos, C.S., Park, K.: Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1–3), 87–101 (2003). https://doi.org/10.1016/S0304-3975(03)00053-7
Tanimura, Y., Nishimoto, T., Bannai, H., Inenaga, S., Takeda, M.: Small-space LCE data structure with constant-time queries. In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 21–25 August 2017, Aalborg, Denmark, pp. 10:1–10:15 (2017). https://doi.org/10.4230/LIPIcs.MFCS.2017.10
Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, 15–17 October 1973, Iowa City, Iowa, USA, pp. 1–11 (1973)
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory IT 23(3), 337–343 (1977)
Acknowledgements
We thank the organizers of StringMasters in Fukuoka, 2016, where we had fruitful discussions on this topic.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Fujishige, Y., Takagi, T., Hendrian, D. (2018). Truncated DAWGs and Their Application to Minimal Absent Word Problem. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds) String Processing and Information Retrieval. SPIRE 2018. Lecture Notes in Computer Science(), vol 11147. Springer, Cham. https://doi.org/10.1007/978-3-030-00479-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-00479-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00478-1
Online ISBN: 978-3-030-00479-8
eBook Packages: Computer ScienceComputer Science (R0)