The quick string set pattern match algorithm based on sorted tree
Renfa Li · 2003
The string pattern matching algorithm, the fundamental problem in computer science,try to find all patterns in the subject string. It has been widely used in engineering and so on. Until now, there is so little work on the string set pattern match problem. Further more, there is no feasible algorithm relative to the problem when the size of the string set is very large. After study on the BM and AG algorithm, a fast string set matching algorithm based on sorted tree is presented in the paper. Compared with other implementations in engineering, it is more efficient in practice. 6figs. ,10refs.