Pattern matching in hypertext

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

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. Manber and Wu pioneered the study of pattern matching in hypertext and defined a hypertext model for pattern matching. Subsequent papers gave algorithms for pattern matching on hypertext with special structures — trees and DAGS. In this paper we present a much simpler algorithm achieving the same complexity which runs on any hypertext graph. We then extend the problem to approximate pattern matching in hypertext, first considering hamming distance and then edit distance. We show that in contrast to regular text, it does make a difference whether the errors occur in the hypertext or the pattern. The approximate pattern matching problem in hypertext with errors in the hypertext turns out to be NP-Complete and the approximate pattern matching problem in hypertext with errors in the pattern has a polynomial time solution.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Andrew Rau-Chaplin, Roberto Tamassia
PublisherSpringer Verlag
Pages160-173
Number of pages14
ISBN (Print)3540633073, 9783540633075
DOIs
StatePublished - 1997
Event5th International Workshop on Algorithms and Data Structures, WADS 1997 - Halifax, Canada
Duration: 6 Aug 19978 Aug 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1272
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Algorithms and Data Structures, WADS 1997
Country/TerritoryCanada
CityHalifax
Period6/08/978/08/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

Dive into the research topics of 'Pattern matching in hypertext'. Together they form a unique fingerprint.

Cite this