Pattern matching in hypertext

Amihood Amir; Moshe Lewenstein; Noa Lewenstein

doi:10.1007/3-540-63307-3_56

Pattern matching in hypertext

Amihood Amir, Moshe Lewenstein, Noa Lewenstein

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Andrew Rau-Chaplin, Roberto Tamassia
Publisher	Springer Verlag
Pages	160-173
Number of pages	14
ISBN (Print)	3540633073, 9783540633075
DOIs	https://doi.org/10.1007/3-540-63307-3_56
State	Published - 1997
Event	5th International Workshop on Algorithms and Data Structures, WADS 1997 - Halifax, Canada Duration: 6 Aug 1997 → 8 Aug 1997

Publication series

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

Conference

Conference	5th International Workshop on Algorithms and Data Structures, WADS 1997
Country/Territory	Canada
City	Halifax
Period	6/08/97 → 8/08/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access to Document

10.1007/3-540-63307-3_56

Cite this

Amir, A., Lewenstein, M., & Lewenstein, N. (1997). Pattern matching in hypertext. In F. Dehne, J.-R. Sack, A. Rau-Chaplin, & R. Tamassia (Eds.), Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings (pp. 160-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1272). Springer Verlag. https://doi.org/10.1007/3-540-63307-3_56

Amir, Amihood ; Lewenstein, Moshe ; Lewenstein, Noa. / Pattern matching in hypertext. Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Andrew Rau-Chaplin ; Roberto Tamassia. Springer Verlag, 1997. pp. 160-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{70c877e27c8f4557a93b228c4e6616c3,

title = "Pattern matching in hypertext",

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.",

author = "Amihood Amir and Moshe Lewenstein and Noa Lewenstein",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 5th International Workshop on Algorithms and Data Structures, WADS 1997 ; Conference date: 06-08-1997 Through 08-08-1997",

year = "1997",

doi = "10.1007/3-540-63307-3_56",

language = "אנגלית",

isbn = "3540633073",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "160--173",

editor = "Frank Dehne and Jorg-Rudiger Sack and Andrew Rau-Chaplin and Roberto Tamassia",

booktitle = "Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings",

address = "גרמניה",

}

Amir, A, Lewenstein, M & Lewenstein, N 1997, Pattern matching in hypertext. in F Dehne, J-R Sack, A Rau-Chaplin & R Tamassia (eds), Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1272, Springer Verlag, pp. 160-173, 5th International Workshop on Algorithms and Data Structures, WADS 1997, Halifax, Canada, 6/08/97. https://doi.org/10.1007/3-540-63307-3_56

Pattern matching in hypertext. / Amir, Amihood; Lewenstein, Moshe; Lewenstein, Noa.
Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Andrew Rau-Chaplin; Roberto Tamassia. Springer Verlag, 1997. p. 160-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1272).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pattern matching in hypertext

AU - Amir, Amihood

AU - Lewenstein, Moshe

AU - Lewenstein, Noa

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84869101539&partnerID=8YFLogxK

U2 - 10.1007/3-540-63307-3_56

DO - 10.1007/3-540-63307-3_56

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84869101539

SN - 3540633073

SN - 9783540633075

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 160

EP - 173

BT - Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Rau-Chaplin, Andrew

A2 - Tamassia, Roberto

PB - Springer Verlag

T2 - 5th International Workshop on Algorithms and Data Structures, WADS 1997

Y2 - 6 August 1997 through 8 August 1997

ER -

Amir A, Lewenstein M, Lewenstein N. Pattern matching in hypertext. In Dehne F, Sack JR, Rau-Chaplin A, Tamassia R, editors, Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings. Springer Verlag. 1997. p. 160-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63307-3_56

Pattern matching in hypertext

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this