A Survey of the Hybrid Exact String Matching Algorithms

Abstract

AbstractThe matching of search string patterns has become a bigger issue of concern because biological sequence databases are growing rapidly at overwhelming proportions so string matching algorithm is an essential scientific tool to assist in solving composite string search problems. At present, the shift of focus is geared towards hybrid algorithms as they provide better performance in various evaluation metrics. Thus, researchers and experts view a hybrid algorithm as the way forward for resolving string search difficulties. Therefore, the concentration will be on the various kinds of hybrid algorithms that have been implemented, their processes, and their performances. This research has performed a systematic literature review by reviewing over 30 papers and identifying 15 string matching hybrid algorithms. When reviewing these hybrid algorithms, it is found that by combining different original algorithms, the hybrid algorithm can outperform the individual algorithms in different evaluation metrics. The purpose, enhanced concepts, and results of these algorithms have been highlighted in the article. This article has critically reviewed different string matching hybrid algorithms and provided useful information for experts and researchers that can utilize strong-matching hybrid algorithms in their systems.KeywordsApproximate string matchExact string matchHybrid string matching algorithmPattern searchString search