Occurrences Algorithm for String Searching Based on Brute-force Algorithm
Abstract
This study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text.
DOI: https://doi.org/10.3844/jcssp.2006.82.85
Copyright: © 2006 Ababneh Mohammad, Oqeili Saleh and Rawan A. Abdeen. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 4,403 Views
- 3,506 Downloads
- 37 Citations
Download
Keywords
- Pattern
- substring
- string searching
- occurrences algorithm