Sign inSubmit

Journal of Computer Science

ISSN 1549-3636 (print)eISSN 1552-6607 (online) Open access
Sign up for alertsSubmit manuscript
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleArticle metrics
Research Article · Free to read · Published 31 January 2006

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Ababneh Mohammad, Oqeili Saleh & Rawan A. Abdeen

Journal of Computer Science, Volume 2, Issue 1, pp. 82–85 · doi.org/10.3844/jcssp.2006.82.85

8,077 accesses5,629 downloads29 citations (Crossref)Journal metrics
Cite Check for updates

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

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

Licence
© Science Publications
Issue
Volume 2, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Occurrences Algorithm for String Searching Based on Brute-force AlgorithmJournal of Computer Science · Volume 2, Issue 1 · pp. 82–85 · © Science PublicationsDownload