To: Author

Article Fingerprint
ReserarchID
CST272TK
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms. Widely, it is used in sequential form which presents good performance. In this paper a parallel implementation of Boyer Moore algorithm is proposed and evaluated. Experimental results show that it is valuable with zero overhead and cost optimal. The comparison between sequential and parallel showed that the parallel implementation was faster and more useful.
Abdulellah A.Alsaheel, Abdullah H.Alqahtani. 2013. "Analysis of Parallel Boyer-Moore String Search Algorithm". Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 13 (GJCST Volume 13 Issue A1).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
v1.2
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 163
Country: Saudi Arabia
Subject: Global Journal of Computer Science and Technology
Authors: Abdulellah A. Alsaheel, Abdullah H. Alqahtani, Abdulatif M. AlAbdulatif (PhD/Dr. count: 0)
View Count (all-time): 494
Total Views (Real + Logic): 4259
Total Downloads (simulated): 332
Publish Date: 2013 01, Tue
Monthly Totals (Real + Logic):
We use cookies and similar technologies to improve site performance, understand traffic, and enhance your publishing experience. Cookie Policy
Choose which optional cookies Global Journals can use. Your preference applies across this platform and can be updated any time.
These cookies are required for core website functionality and security.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.