Abstract
In this paper, we propose two improved algorithms for exact string matching problem, which aims to find all the positions i's in a given text where a given pattern occurs. Our algorithms find the optimal selective comparing order of the pattern so that we could have a better performance in the searching phase. To find the optimal comparing order, we adopt the branch and bound approach. Moreover, our proposed algorithm can be combined with other existing exact string matching algorithms to improve the searching efficiency. The experimental results show that our algorithms indeed have the smallest number of character comparisons when comparing with the other algorithms using different comparing order. Besides, our algorithms are also efficient in the running time as compared with other existing exact string matching algorithms.