Tuning string matching for huge pattern sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2676, Issue , 2003, Pages 211-224

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

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

AHO-CORASICK ALGORITHMS; BIT PARALLELISM; FILTERING EFFICIENCY; FILTERING METHOD; MULTIPLE PATTERNS; PATTERN SET; Q-GRAMS; STRING MATCHING;

ALGORITHMS;

EID: 26444504320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_16     Document Type: Article

References (17)

1. A. Aho, M. Corasick: Efficient string matching: An aid to bibliographic search. Communications of the ACM 18, 6 (1975), 333-340.
2. R. Baeza-Yates. Improved string searching. Software - Practice and Experience, 19, 3 (1989), 257-271.
3. R. Baeza-Yates, G. Gonnet: A new approach to text searching. Communications of ACM 35, 10 (1992), 74-82.
4. R. Boyer, S. Moore: A fast string searching algorithm. Communications of the ACM 20 (1977), 762-772.
5. B. Commentz-Walter: A string matching algorithm fast on the average. Proc. 6th International Colloquium on Automata, Languages and Programming, Lecture Notes on Computer Science 71, 1979, 118-132.
6. M. Crochemore, W. Rytter: Text algorithms. Oxford University Press, 1994.
7. K. Fredriksson: Fast string matching with super-alphabet. Proc. SPIRE '02, String Processing and Information Retrieval, Lecture Notes in Computer Science 2476, 2002, 44-57.
8. M. Fisk, G. Varghese: Fast content-based packet handling for intrusion detection. UCSD Technical Report CS2001-0670, 2001.
9. B. Gum, R. Lipton: Cheaper by the dozen: batched algorithms. Proc. First SIAM International Conference on Data Mining, 2001
10. N. Horspool: Practical fast searching in strings. Software - Practice and Experience 10 (1980), 501-506.
11. R. Karp, M. Rabin: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31 (1987), 249-260.
12. R. Muth, U. Manber: Approximate multiple string search. Proc. CPM '96, Combinatorial Pattern Matching, Lecture Notes in Computer Science 1075, 1996, 75-86.
13. G. Navarro, M. Raffinot: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithms 5, 4 (2000), 1-36.
14. G. Navarro, M. Raffinot: Flexible pattern matching in strings. Cambridge University Press, 2002.
15. S. Wu, U. Manber: A fast algorithm for multi-pattern searching. Report TR-94-17, Department of Computer Science, University of Arizona, 1994.
16. S. Wu, U. Manber: Agrep - A fast approximate pattern-matching tool. Proc. Usenix Winter 1992 Technical Conference, 1992, 153-162.
17. R. Zhu, T. Takaoka: A technique for two-dimensional pattern matching. Communications of the ACM 32 (1989), 1110-1120.