A taxonomy of sublinear multiple keyword pattern matching algorithms

Science of Computer Programming

Volumn 27, Issue 2, 1996, Pages 85-118

  Watson, B W ^a   Zwaan, G ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER AIDED ANALYSIS; DATA PROCESSING; GRAPH THEORY; TREES (MATHEMATICS);

TAXONOMY;

INFORMATION ANALYSIS;

EID: 0030246629     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(96)00008-1     Document Type: Article

References (20)

1. A.V. Aho, Algorithms of finding patterns in strings, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 255-300.
2. A.V. Aho and M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM 18 (1975) 333-340.
3. R.S. Boyer and J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (1977) 762-772.
4. M. Broy, Program construction by transformations: a family tree of sorting programs, in: A.W. Biermann and G. Guiho, eds., Computer Program Synthesis Methodologies, NATO ASI, 1981, NATO ASI Series, Series C: Mathematical and Physical Sciences, Vol. 95 (Reidel, Dordrecht, 1983) 1-49.
5. B. Commentz-Walter, A string matching algorithm fast on the average, in: Proc. ICALP '79, Lecture Notes in Computer Science, Vol. 71 (Springer, Berlin, 1979) 118-132.
6. B. Commentz-Walter, A string matching algorithm fast on the average, Tech. Report TR 79.09.007, IBM-Germany, Scientific Center Heidelberg, 1979.
7. J. Darlington, A synthesis of several sorting algorithms, Acta Inform. 11 (1978) 1-30.
8. E.W. Dijkstra, A Discipline of Programming (Prentice-Hall, Englewood Cliffs, NJ, 1976).
9. J.-J. Fan and K.-Y. Su, An efficient algorithm for matching multiple patterns, IEEE Trans. Knowledge Data Eng. 5 (1993) 339-351.
10. J.-J. Fan and K.-Y. Su, An efficient algorithm for matching multiple patterns, in: J. Aoe, ed., Computer Algorithms: String Pattern Matching Strategies (IEEE Computer Society Press, Los Alamitos, CA, 1994).
11. E. Fredkin, Trie memory, Comm. ACM 3 (1960) 490-499.
12. A. Hume and D.M. Sunday, Fast string searching, Softw. Pract. Exper. 21 (1991) 1221-1248.
13. H.B.M. Jonkers, Abstraction, Specification and Implementation Techniques, with an Application to Garbage Collection, Mathematical Centre Tracts, Vol. 166 (Mathematisch Centrum, Amsterdam, 1983).
14. D.E. Knuth, J.H. Morris, Jr and V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
15. A.J.J.M. Marcelis, On the classification of attribute evaluation algorithms, Sci. Comput. Programming 14 (1) (1990) 1-24.
16. W. Rytter, A correct preprocessing algorithm for Boyer-Moore string-searching, SIAM J. Comput. 9 (1980) 509-512.
17. B.W. Watson, The performance of single-keyword and multiple-keyword pattern matching algorithms, Computing Science Report 94/19, Department of Computing Science, Eindhoven University of Technology, 1994.
18. B.W. Watson, Taxonomies and toolkits of regular language algorithms, Ph.D. Thesis, Department of Computing Science, Eindhoven University of Technology, 1995.
19. B.W. Watson and G. Zwaan, A taxonomy of keyword pattern matching algorithms. Computing Science Report 92/27, Department of Computing Science, Eindhoven University of Technology, 1992.
20. B.W. Watson and G. Zwaan, A taxonomy of keyword pattern matching algorithms, in: H. Wijshoff, ed., Proc. Computing Science in the Netherlands '93 (Stichting Mathematisch Centrum, Amsterdam, 1993) 25-39.