Abstract
Weighted Directed Word Graph is a new text-indexing structure which is based on a new compaction method on DAWG. WDWGs are basically cyclic, means that they may accept infinite strings. But by assigning weights to the edges, the acceptable strings are limited only to the substrings of input strings. The size of WDWGs is smaller than that of DAWGs both in theory and practice. A linear-time on-line construction algorithm for WDWGs is also presented.
Supported by National Natural Science Foundation of China No.90204014 and Natural Science Foundation of Science and Technology Department of Jilin Province No.20030516
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
Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automation recognizing the subwords of a text. Theoretical Computer Science 40, 31–55 (1985)
Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for effcient text retrieval and analysis. Journal of the ACM 34(3), 578–595 (1987)
Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 9. Linear Modeling: Background and Application, vol. 2, pp. 399–462. Springer, Heidelberg (1997)
Crochemore, M., Vérin, R.: Direct construction of compact directed acyclic word graphs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 116–129. Springer, Heidelberg (1997)
Gusfeld, D.: Algorithms on Strings Trees and Sequences. Cambridge UniversityPress, New York (1997)
Kärkkäinen, J.: Suffix cactus: a cross between suffix tree and suffix array. Combinatorial Pattern Matching 937, 191–204 (1995)
Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-Line Construction of Compact Directed Acyclic Word Graphs. Discrete Applied Mathematics 146(2), 156–179 (2005); special issue for In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 169–179. Springer, Heidelberg (2001)
Zhang, M.: Linerity of Weighted Directed Word Graph,Technical Report of Jilin University, College of Computer Science and Technology (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, M., Hu, L., Li, Q., Ju, J. (2005). Weighted Directed Word Graph. In: Apostolico, A., Crochemore, M., Park, K. (eds) Combinatorial Pattern Matching. CPM 2005. Lecture Notes in Computer Science, vol 3537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496656_14
Download citation
DOI: https://doi.org/10.1007/11496656_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26201-5
Online ISBN: 978-3-540-31562-9
eBook Packages: Computer ScienceComputer Science (R0)