Advertisement

Weighted Directed Word Graph

  • Meng Zhang
  • Liang Hu
  • Qiang Li
  • Jiubin Ju
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

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.

Keywords

Weighted Edge Index Structure Intrusion Detection System Input String Congruence Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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)CrossRefMathSciNetGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Gusfeld, D.: Algorithms on Strings Trees and Sequences. Cambridge UniversityPress, New York (1997)CrossRefGoogle Scholar
  6. 6.
    Kärkkäinen, J.: Suffix cactus: a cross between suffix tree and suffix array. Combinatorial Pattern Matching 937, 191–204 (1995)Google Scholar
  7. 7.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Zhang, M.: Linerity of Weighted Directed Word Graph,Technical Report of Jilin University, College of Computer Science and Technology (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Meng Zhang
    • 1
  • Liang Hu
    • 1
  • Qiang Li
    • 1
  • Jiubin Ju
    • 1
  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina

Personalised recommendations