A VERY FAST SUBSTRING SEARCH ALGORITHM

被引：310

作者：

SUNDAY, DM

机构：

来源：

COMMUNICATIONS OF THE ACM | 1990年 / 33卷 / 08期

关键词：

Algorithms; Boyer-Moore; Knuth-Morris-Pratt; pattern; search; substring;

D O I：

10.1145/79173.79184

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: 1990 a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm. © 1990, ACM. All rights reserved.

引用

页码：132 / 142

页数：11