Several algorithms including BM, BMG, AC and AC-BM are discussed and the running time of the algorithms are measured on the snort in the paper. The results show that AC and AC-BM are faster than BM and BMG on the large number of patterns, but on the small number of patterns we obtained the opposite result. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Wang, M., & Zhu, L. (2012). Research about pattern matching algorithm. In Advances in Intelligent and Soft Computing (Vol. 127 AISC, pp. 27–32). Springer Verlag. https://doi.org/10.1007/978-3-642-27334-6_4
Mendeley helps you to discover research relevant for your work.