Research Article Open Access

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Ababneh Mohammad, Oqeili Saleh and Rawan A. Abdeen

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.

Journal of Computer Science
Volume 2 No. 1, 2006, 82-85

DOI: https://doi.org/10.3844/jcssp.2006.82.85

Submitted On: 9 August 2005 Published On: 31 January 2006

How to Cite: Mohammad, A., Saleh, O. & Abdeen, R. A. (2006). Occurrences Algorithm for String Searching Based on Brute-force Algorithm . Journal of Computer Science, 2(1), 82-85. https://doi.org/10.3844/jcssp.2006.82.85

  • 3,409 Views
  • 2,944 Downloads
  • 30 Citations

Download

Keywords

  • Pattern
  • substring
  • string searching
  • occurrences algorithm