A Fast Multiple String-Pattern Matching Algorithm

@inproceedings{Kim99, abstract = {In this paper, we propose a simple but efficient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experiments demonstrate that our algorithm runs faster than state-of-the-art multiple pattern matching...}, author = {Kim, Sun and Kim, Yanggon }, booktitle = {Proceedings of 17th AoM/IAoM Conference on Computer Science}, citeulike-article-id = {366731}, keywords = {hma, intrusion\_detection, string\_search}, month = {August}, posted-at = {2005-10-27 14:17:14}, priority = {0}, title = {A Fast Multiple String-Pattern Matching Algorithm}, url = {http://citeseer.ist.psu.edu/328568.html}, year = {1999} }

TY - CONF ID - Kim99 L3 - citeulike-article-id:366731 N2 - In this paper, we propose a simple but efficient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experiments demonstrate that our algorithm runs faster than state-of-the-art multiple pattern matching... TI - A Fast Multiple String-Pattern Matching Algorithm T2 - Proceedings of 17th AoM/IAoM Conference on Computer Science KW - hma KW - intrusion_detection KW - string_search AU - Kim, Sun AU - Kim, Yanggon PY - 1999/August// UR - http://citeseer.ist.psu.edu/328568.html ER -