A STUDY OF PATTERN-MATCHING ALGORITHMS

被引：0

作者：

PIRKLBAUER, K ^{[1
]}

机构：

[1] JOHANNES KEPLER UNIV,INST INFORMAT,A-4040 LINZ,AUSTRIA

来源：

STRUCTURED PROGRAMMING | 1992年 / 13卷 / 02期

关键词：

ALGORITHMS; PATTERN MATCHING;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

There are many strategies for searching for a pattern in a string. And there exist many papers on this topic. This paper does not present a new pattern-matching algorithm but offers a survey of well-known algorithms and compares their run-time behavior. The theoretical background of the pattern-matching algorithms is discussed in several books on algorithms. In contrast to these general considerations, the algorithms are compared by measuring the behavior of typical examples.

引用

页码：89 / 98

页数：10