Linear pattern matching algorithms-英文文献.pdfVIP

LINEAR PATTERN MATCHING ALGORITHMS Peter Weiner * The Rand Corporation, Santa Monica, California 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 pre- viously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algo- rithm 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. I. Introduction Before giving a formal definition of a bi-tree, we re- view basic definitions and terminology concerning t-ary In 1970, Knuth, Morris, and Pratt [1-2] showed how to trees. (See Knuth [7] for further details.) match a given pattern into another given string in time A t-ary tpee T over [ = {al, ... ,at } is a set of proportional to the sum of the lengths of the pattern nodes N which is eit