A very fast substring search algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Hi-index | 0.00 |
Combined with the characteristics of network security audit system, paper introduced the idea of dynamic programming to pattern-matching algorithm, and gave the best dynamic matching algorithm, that is, by solving for matching pairs of local sub-problem, and for the number of different rules, (deleted) to find the best combination for the pattern-matching algorithms, then to achieve the strategy of optimal solution overall. Experimental results show that, the algorithm will greatly improve the efficiency of pattern matching in the network security auditing system.