论文信息 - Pattern Matching In Hypertext

Pattern Matching In Hypertext

A myriad of textual problems have been considered in the pattern matching field with many non-trivial results. Nevertheless, surprisingly little work has been done on the natural combination of pattern matching and hypertext. In contrast to regular text, hypertext has a nonlinear structure and the techniques of pattern matching for text cannot be directly applied to hypertext.

Moshe Lewenstein | Amihood Amir | Noa Lewenstein

[1] Jakob Nielsen,et al. Hypertext and hypermedia , 1990 .

[2] Udi Manber,et al. APPROXIMATE STRING MATCHING WITH ARBITRARY COSTS FOR TEXT AND HYPERTEXT , 1993 .

[3] Gad M. Landau,et al. Fast Parallel and Serial Approximate String Matching , 1989, J. Algorithms.

[4] Tatsuya Akutsu. A Linear Time Pattern Matching Algorithm Between a String and a Tree , 1993, CPM.

[5] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[6] Uzi Vishkin,et al. Efficient approximate and dynamic matching of patterns using a labeling paradigm , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7] Raffaele Giancarlo,et al. Dynamic Dictionary Matching , 1994, J. Comput. Syst. Sci..

[8] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[9] Dong Kyue Kim,et al. String Matching in Hypertext , 1995, CPM.

[10] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[11] Roberto Grossi,et al. Optimal on-line search and sublinear time update in string matching , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12] V AhoAlfred,et al. Efficient string matching , 1975 .

[13] Alejandro A. Schäffer,et al. Improved dynamic dictionary matching , 1995, SODA '93.

[14] Karl R. Abrahamson. Generalized String Matching , 1987, SIAM J. Comput..