Summary: Pattern Matching in Hypertext \Lambda
Amihood Amir y Moshe Lewenstein z Noa Lewenstein x
Georgia Tech BarIlan University BarIlan University
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
nontrivial 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 nonlinear
structure and the techniques of pattern matching for text cannot be directly applied to hyper
Manber and Wu  pioneered the study of pattern matching in hypertext and defined a
hypertext model for pattern matching. Akutsu  developed an algorithm that can be used for
exact pattern matching in a treestructured hypertext. Park and Kim  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