Single pattern string exact matching algorithms based on hybrid strategy
基于组合策略的单模式串精确匹配算法

It is researched by comparing their time complexities of LDM, ILDM1, ILDM2 algorithm etc. with RF algorithm that only uses a smallest suffix automaton. The experiment shows that the time complexities of LDM, ILDM1 algorithms are poorer than that of RF algorithm, and there is no efficiency for the hybrid strategy in LDM, ILDM1. The experiment also finds that it is not the best strategy for middle and small alphabet that the forward finite state automaton is suspended when the length of pattern prefixes-R is not greater than half of m, the length of pattern string, in ILDM2 algorithm.