DMCA
Linear pattern matching algorithms (1972)
| Venue: | IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE |
| Citations: | 546 - 0 self |
BibTeX
@INPROCEEDINGS{Weiner72linearpattern,
author = {Peter Weiner},
title = {Linear pattern matching algorithms},
booktitle = {IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE},
year = {1972},
pages = {1--11},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.
