Occurrences Algorithm for String Searching Based on Brute-force Algorithm

  • Mohammad A
  • Saleh O
  • Abdeen R
N/ACitations
Citations of this article
55Readers
Mendeley users who have this article in their library.

Abstract

String searching is a very important component of many problems, including text editing, text searching and symbol manipulation. In this paper a string searching algorithm is proposed as an improvement of the brute-force searching algorithm. The algorithm is named Start-End-Mid Algorithm. The proposed algorithm does not preprocess neither the pattern nor the text to perform searching.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free