The role of different types of comparisons on string searching algorithms

Abstract EN

A new algorithm called Character-Comparison to Character-Access (CCCA) is developed to test the effect of both: 1) converting character-comparison and number-comparison into character-access and 2) the starting point of checking on the performance of the checking operation in string searching.

An experiment is performed using English text and DNA text; the results are compared with five algorithms, namely, Naive, BM, Inf_Suf_Pref, Raita, and Cycle algorithms.

With the CCCA algorithm, the results suggest that the evaluation criteria of the average number of comparisons in the first check and the average number of comparisons in the second check are improved up to 2.87% and 61.56%, respectively.

Furthermore, the results suggest that the clock time required by the other algorithms is improved in range from 22.13% to 42.33% by the new CCCA algorithm.