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.

Many problems encountered require string searching to solve them. Thus, string searching algorithms are important. They play the vital role in various fields and applications, including text editing, finding part of DNA in bio informatics engineering, text searching, computer security, linguistics, artificial intelligence and web search engines. In this paper, a string searching algorithm is proposed. The proposed algorithm aims to improve the brute-force searching algorithm. It finds all the occurrences of a pattern within a given text. The pattern and the text are to be preprocessed before the actual searching starts. General TermsString searching, string matching, pattern matching, algorithm.