A taxonomy of sublinear multiple keyword pattern matching algorithms

DOI10.1016/0167-6423(96)00008-1zbMath0858.68026OpenAlexW2138373802MaRDI QIDQ1924627

Bruce W. Watson, Gerard Zwaan

Publication date: 25 March 1997

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-taxonomy-of-sublinear-multiple-keyword-pattern-matching-algorithms(ec5fd5e6-108d-4fea-a4ef-7627e466af4d).html

zbMATH Keywords

taxonomyBoyer-Moore algorithmCommentz-Walter algorithmsublinear keyword pattern matching algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items

A new regular grammar pattern matching algorithm., Faster subsequence recognition in compressed strings, The validation of SGML content models, Partial derivatives of regular expressions and finite automaton constructions, Local languages and the Berry-Sethi algorithm, An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata, A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms, Improved pattern-scan-order algorithms for string matching, Fast string matching for DNA sequences, Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm, A complete mechanization of correctness of a string-preprocessing algorithm