Applied Comparison of String Matching Algorithms

Authors : Zeynep BARUT, Volkan ALTUNTAŞ

Pages : 76-85

View : 18 | Download : 25

Publication Date : 2023-06-30

Article Type : Research Paper

Abstract :String matching algorithms are used when a pattern needs to be found in a particular string. The aim of this research is to explain the basic ideas and complexities of current algorithms and to make an applied comparison. There are many algorithms used for string matching. In this study, Knuth-Morris-Pratt, Rabin Karp and Boyer Moore Horspool algorithms were compared. It is aimed to increase the accuracy of the study by choosing different algorithms. By explaining the basic ideas, possible difficulties and complexities of the algorithms, it is emphasized how these problems can be solved. As a result of the studies, it has been seen that the Knuth-Morris-Pratt algorithm outperforms other algorithms in most cases. The second best performing algorithm was Boyer Moore Horspool algorithm, and the worst performing algorithm was Rabin Karp algorithm.
Keywords : String matching, DNA sekansı, Gen analizi