@article {10.3844/ajeassp.2011.102.107,
article_type = {journal},
title = {A Fast Hybrid Algorithm for the Exact String Matching Problem},
author = {Al-mazroi, Abdulwahab Ali and Rashid, Nur’Aini Abdul},
volume = {4},
number = {1},
year = {2011},
month = {Jan},
pages = {102-107},
doi = {10.3844/ajeassp.2011.102.107},
url = {https://thescipub.com/abstract/ajeassp.2011.102.107},
abstract = {Problem statement: Due to huge amount and complicated nature of data being generated
recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and
matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid
algorithm (called BRSS) to ensure speedy results. Approach: This study proposes the combination of
two algorithms namely Berry-Ravindran and Skip Search Algorithms to form a hybrid algorithm in
order to boost search performance. Results: The proposed hybrid algorithm contributes to better
results by reducing the number of attempts, number of character comparisons and searching time. The
performance of the hybrid was tested using different types of data-DNA, Protein and English text. The
percentage of the improvements of the hybrid algorithm compared to Berry-Ravindran in DNA,
Protein and English text are 50%, 43% and 44% respectively. The percentage of the improvements
over Skip Search algorithm in DNA, Protein and English text are 20%, 30% and 18% respectively. The
criteria applied for evaluation are number of attempts, number of character comparisons and searching
time. Conclusion: The study shows how the integration of two algorithms gives better results than the
original algorithms even the same data size and pattern lengths are applied as test evaluation on each of
the algorithms.},
journal = {American Journal of Engineering and Applied Sciences},
publisher = {Science Publications}
}