Affiliation:
1. East Stroudsburg Univ. of Pennsylvania, East Stroudsburg, PA
Abstract
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: (1) a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm.
Publisher
Association for Computing Machinery (ACM)
Reference4 articles.
1. A fast string searching algorithm
2. Smit G.V. A comparison of three string matchin~ algorithms. Solho.--Prac. andExb. 12. I (lan. 19~32) 57-66. - " ' ' Smit G.V. A comparison of three string matchin~ algorithms. Solho.--Prac. andExb. 12. I (lan. 19~32) 57-66. - " ' '
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献