A New Efficient Hybrid String Matching Algorithm to Solve the Exact String Matching Problem

Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 20, Issue 2

Abstract

The string matching algorithms are considered one of the most studied in the computer science field because the fundamental role they play in many different applications such as information retrieval, editors, security applications, firewall, and biological applications. This study aims to introduce a new hybrid algorithm based on two well-known algorithms, namely, the modified Horspool and SSABS hybrid algorithms. Two factors used to analyze the proposed algorithm which is the total number of character comparisons and total number of attempts. The ABSBMH algorithm which is the name chosen for the proposed hybrid algorithm was tested on different types of standard datatype. The ABSBMH algorithm shows less number of character comparisons when compared to the results of other algorithms, while show almost no big different in the results of number of attempts this is due to the proposed hybrid algorithm preprocessing phase based on SSABS algorithm which is the same preprocessing phase of the Quick Search algorithm, so for all these reasons the results of the ABSBMH and other algorithms in terms of total number of attempts have been shown a small different, this is because it use different pattern lengths which are selected randomly from the databases. The experiential results expose that performance of the hybrid algorithm influenced by the type of the dataset used, the DNA sequence shows the worst result, while the English text datatype show the best results in terms of total number of character comparisons.

Authors and Affiliations

Sinan Sameer Mahmood Al-Dabbagh, Nawaf Hazim Barnouti

Keywords

Related Articles

A Stochastic Model of the Dynamics of Stock Price for Forecasting

In this work, a stochastic model of some selected stocks in the Nigerian Stock Exchange (NSE) is formulated. We considered four different stocks and their market prices. The likelihood of each change occurring in the sto...

Application of Quick Simplex Method on the Dual Simplex Method (A New Approach)

In this article, we suggest a new approach while solving Dual simplex method using Quick Simplex Method. Quick Simplex Method attempts to replace more than one basic variable simultaneously so it involves less iteration...

The Topp-Leone Burr-XII Distribution: Properties and Applications

In this paper we introduce a new generalization of the Burr-XII distribution using the genesis of the Topp-Leone distribution and is named as Topp-Leone Burr-XII (TLBXII) distribution. The statistical properties of this...

On the Hyper-Poisson Distribution and its Generalization with Applications

In this paper, we fit the hyper-Poisson, and the Mittag-Leffer function (MLFD) distributions to data exhibiting over and under dispersion. Three frequency data sets were employed with one exhibiting under-dispersion. We...

Design and Implementation of Photo-induced Heart Beat Monitoring System

This study presents the design of photo-induced heart beat monitor that uses cheap and readily available materials unlike most of all the rather sophisticated heart beat monitoring devices that uses complicated designs a...

Download PDF file
  • EP ID EP322073
  • DOI 10.9734/BJMCS/2017/30497
  • Views 99
  • Downloads 0

How To Cite

Sinan Sameer Mahmood Al-Dabbagh, Nawaf Hazim Barnouti (2017). A New Efficient Hybrid String Matching Algorithm to Solve the Exact String Matching Problem. Journal of Advances in Mathematics and Computer Science, 20(2), 1-14. https://europub.co.uk/articles/-A-322073