Abstract
There are several data structures that allow searching for a pattern P in a preprocessed text T in time dependent just on the length of P. In this paper we present an implementation of CDAWG’s— Compact Direct Acyclic Word Graphs. While the previous implementations of CDAWG’s required from 7n to 23n bytes of memory space, ours achieves 1.7 n to 5n for a text T of length n. The implementation is suitable for large data files, since it minimizes the number of disk accesses. If disk accesses are not to be optimized, space requirements can be further decreased.
This research has been partially supported by MŠMT research program No MSM 212300014 and by GAČR research programs No GP201/01/P082 and GA201/01/1433.
Work by this author is partially supported by CNRS action AlBio,NATO Science Programme grant PST.CLG.977017,and Wellcome Trust Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Balík. Implementation of DAWG. In J. Holub and M. Ŝimánek, editors, Proceedings of the Prague Stringology Club Workshop’ 98, pages 26–35, Czech Technical University, Prague, Czech Republic, 1998. Collaborative Report DC-98-06.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci.,40(1):31–55, 1985.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. McConnel. Complete inverted files for effcient text retrieval and analysis. J. Assoc. Comput. Mach., 34(3):578–595, 1987.
M. Crochemore. Transducers and repetitions. Theor. Comput. Sci., 45(1):63–86, 1986.
M. Crochemore, C. Hancart, and T. Lecroq. Algorithmique du texte. Vuibert, 2001. 347 pages.
M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
M. Crochemore and R. Vérin. Direct construction of compact directed acyclic word graphs. In A. Apostolico and J. Hein, editors, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, number 1264 in Lecture Notes in Computer Science, pages 116–129, Aarhus, Denmark, 1997. Springer-Verlag, Berlin.
M. Crochemore and R. Vérin. On compact directed acyclic word graphs. In J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, number 1261 in Lecture Notes in Computer Science, pages 192–211. Springer-Verlag, Berlin, 1997.
D. Gusfield. Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge, 1997.
S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, number 2087 in Lecture Notes in Computer Science, pages 169–180. Springer-Verlag, Berlin, 2001.
S. Kurtz. Reducing the space requirements of suffix trees. Softw. Pract. Exp., 29(13):1149–1171, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holub, J., Crochemore, M. (2003). On the Implementation of Compact DAWG’s. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_31
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive