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
186 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved Pattern Matching Sunday Algorithm for Message Sequence Check in Smart Substation;2024 9th Asia Conference on Power and Electrical Engineering (ACPEE);2024-04-11
2. Jumping pattern matching algorithm for protecting search content;Proceedings of the 2023 3rd International Conference on Big Data, Artificial Intelligence and Risk Management;2023-11-24
3. A novel approach to solve exact matching problem using multi-splitting of text patterns;International Journal of System Assurance Engineering and Management;2023-06-01
4. Parametric Timed Pattern Matching;ACM Transactions on Software Engineering and Methodology;2023-01-31
5. Largest Shift String Matching Algorithm: Blend of Berry Ravindran, Zhu-Takaoka and Back & Forth Matching Algorithm;2022 25th International Conference on Computer and Information Technology (ICCIT);2022-12-17