Multipattern string matching with q-grams

ACM Journal of Experimental Algorithmics

Volumn 11, Issue , 2006, Pages

  Salmela, Leena ^a   Tarhio, Jorma ^a   Kytöjoki, Jari ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Content scanning; Intrusion detection; Multiple string matching

Indexed keywords

EID: 84925643023     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1187436.1187438     Document Type: Article

References (25)

1. ABRAHAMSON, K. 1987. Generalized string matching. SIAM Journal on Computing 16, 6, 1039-1051.
2. AHO, A. AND CORASICK, M. 1975. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6, 333-340.
3. BAEZA-YATES, R. 1989. Improved string searching. Softw. Pract. Exper. 19, 3, 257-271.
4. BAEZA-YATES, R. AND GONNET, G. 1992. A new approach to text searching. Commun. ACM 35, 10, 74-82.
5. BOYER, R. ANDMOORE, J. 1977. A fast string searching algorithm. Commun. ACM20, 10, 762-772.
6. th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 71. Springer-Verlag, Berlin. 118-132.
7. CROCHEMORE, M. AND RYTTER, W. 1994. Text Algorithms. Oxford University Press, New York.
8. FISK,M. AND VARGHESE,G. 2001. Fast content-based packet handling for intrusion detection. Tech. Rep. CS2001-0670, University of California, San Diego, CA.
9. th Symposium on String Processing and Information Retrieval (SPIRE'02). Lecture Notes in Computer Science, vol. 2476. Springer-Verlag, Berlin. 44-57.
10. th Symposium on String Processing and Information Retrieval (SPIRE'05). Lecture Notes in Computer Science, vol. 3772. Springer-Verlag, Berlin.
11. st SIAM International Conference on Data Mining.
12. HORSPOOL, N. 1980. Practical fast searching in strings. Softw. Pract. Exper. 10, 501-506.
13. KARP, R. AND RABIN, M. 1987. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31, 249-260.
14. th AoM/IAoM Conference on Computer Science.
15. MARKATOS, E. P., ANTONATOS, S., POLYCHRONAKIS, M., AND ANAGNOSTAKIS.K.G. 2002. Exclusion-based signature matching for intrusion detection. In Proceedings of the IASTED International Conference on Communications and Computer Networks (CCN). ACTA Press. Calgary, AB, Canada, 146-152.
16. th Combinatorial Pattern Matching (CPM'96). Lecture Notes in Computer Science, vol. 1075. Springer-Verlag, Berlin. 75-86.
17. NAVARRO, G. AND RAFFINOT, M. 2000. Fast and flexible string matching by combining bitparallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) 5, 4, 1-36.
18. NAVARRO, G. AND RAFFINOT, M. 2002. Flexible pattern matching in strings. Cambridge University Press, Cambrige, UK.
19. th Symposium on String Processing and Information Retrieval (SPIRE'03). Lecture Notes in Computer Science, vol. 2857. Springer-Verlag, Berlin. 80-94.
20. th Symposium on String Processing and Information Retrieval (SPIRE'05). Lecture Notes in Computer Science, vol. 3772. Springer-Verlag, Berlin.
21. TUCK, N., SHERWOOD, T., CALDER, B., AND VARGHESE, G. 2004. Deterministic memory-efficient string matching algorithms for intrusion detection. In Proceedings of the IEEE Infocom Conference.
22. WU, S. AND MANBER, U. 1992a. Agrep - a fast approximate pattern-matching tool. In Proceedings of the Usenix Winter 1992 Technical Conference. 153-162.
23. WU, S. AND MANBER, U. 1992b. Fast text searching allowing errors. Commun. ACM 35, 10, 83-91.
24. WU, S. AND MANBER, U. 1994. A fast algorithm for multi-pattern searching. Tech. Rep. TR-94-17, Department of Computer Science. University of Arizona, Tucson, Arizona.
25. ZHU, R. AND TAKAOKA, T. 1989. A technique for two-dimensional pattern matching. Commun. ACM 32, 1110-1120.