Summary: Pattern Matching in Hypertext \Lambda
Amihood Amir y Moshe Lewenstein z Noa Lewenstein x
Georgia Tech Bar­Ilan University Bar­Ilan University
and
Bar­Ilan University
Abstract
The importance of hypertext has been steadily growing over the last decade. Internet and
other information systems use hypertext format, with data organized associatively rather than
sequentially or relationally.
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 combina­
tion of pattern matching and hypertext. In contrast to regular text, hypertext has a non­linear
structure and the techniques of pattern matching for text cannot be directly applied to hyper­
text.
Manber and Wu [14] pioneered the study of pattern matching in hypertext and defined a
hypertext model for pattern matching. Akutsu [2] developed an algorithm that can be used for
exact pattern matching in a tree­structured hypertext. Park and Kim [16] considered regular
pattern matching in hypertext. They developed a complex algorithm that works for hypertext
with an underlying structure of a DAG.
In this paper we present a much simpler algorithm achieving the same complexity which

Source: Amir, Amihood - Computer Science Department, Bar Ilan University

Collections: Mathematics