Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 6
Abstract
The string matching problem is considered as one of the most interesting research areas in the computer science field because it can be applied in many essential different applications such as intrusion detection, search analysis, editors, internet search engines, information retrieval and computational biology. During the matching process two main factors are used to evaluate the performance of the string matching algorithm which are the total number of character comparisons and the total number of attempts. This study aims to produce an efficient hybrid exact string matching algorithm called Sinan Sameer Tuned Boyer Moore-Quick Skip Search (SSTBMQS) algorithm by blending the best features that were extracted from the two selected original algorithms which are Tuned Boyer-Moore and Quick-Skip Search. The SSTBMQS hybrid algorithm was tested on different benchmark datasets with different size and different pattern lengths. The sequential version of the proposed hybrid algorithm produces better results when compared with its original algorithms (TBM and Quick-Skip Search) and when compared with Maximum-Shift hybrid algorithm which is considered as one of the most recent hybrid algorithm. The proposed hybrid algorithm has less number of attempts and less number of character comparisons.
Authors and Affiliations
Sinan Sameer Mahmood Al-Dabbagh, Nuraini bint Abdul Rashid, Mustafa Abdul Sahib Naser, Nawaf Hazim Barnouti
Keywords
Related Articles
- EP ID EP259531
- DOI 10.14569/IJACSA.2017.080615
- Views 109
- Downloads 0
Preference in using Agile Development with Larger Team Size
Agile software development includes a group of software development methodologies based on iterative development, where requirements and solutions evolve through collaboration between cross-functional self-organizing tea...
For an Independent Spell-Checking System from the Arabic Language Vocabulary
In this paper, we propose a new approach for spell-checking errors committed in Arabic language. This approach is almost independent of the used dictionary, of the fact that we introduced the concept of morphological ana...
Resistance to Statistical Attacks of Parastrophic Quasigroup Transformation
The resistance to statistical kind of attacks of encrypted messages is a very important property for designing cryptographic primitives. In this paper, the parastrophic quasigroup PE-transformation, proposed elsewhere, i...
An Opportunistic Dissemination Protocol for VANETs
Crowded places like Hajj environment in Makkah which host from 2 to 3 million on specific area and time can pose health challenges for pilgrims who need medical care. One of the solutions to overcome such difficulties is...
Image noise Detection and Removal based on Enhanced GridLOF Algorithm
Image noise removal is a major task in image processing where noise can harness any information inferred from the image especially when the noise level is high. Although there exists many outlier detection approaches use...