Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
| Autor: | Sinan Sameer Mahmood Al-Dabbagh, Mustafa Abdul Sahib Naser, Nuraini bint Abdul Rashid, Nawaf Hazim Barnouti |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
General Computer Science Boyer–Moore–Horspool algorithm Computer science Commentz-Walter algorithm 020206 networking & telecommunications Best-first search 02 engineering and technology String searching algorithm Hybrid algorithm Rabin–Karp algorithm law.invention law Search algorithm Ramer–Douglas–Peucker algorithm 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Boyer–Moore string search algorithm Difference-map algorithm Algorithm FSA-Red Algorithm |
| Zdroj: | International Journal of Advanced Computer Science and Applications. 8 |
| ISSN: | 2156-5570 2158-107X |
| DOI: | 10.14569/ijacsa.2017.080615 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|