Fast practical multi-pattern matching

DOI10.1016/S0020-0190(99)00092-7zbMath0999.68246OpenAlexW2104144328WikidataQ61677971 ScholiaQ61677971MaRDI QIDQ1606976

Maxime Crochemore, Artur Czumaj, Wojciech Plandowski, Thierry Lecroq, Leszek Gąsieniec

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00092-7

zbMATH Keywords

multi-pattern matching problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for text processing; mathematical typography (68U15)

Related Items

Average complexity of exact and approximate multiple string matching ⋮ On the Structure of Consistent Partitions of Substring Set of a Word ⋮ A fast algorithm for the all-pairs suffix-prefix problem ⋮ Fast algorithms for single and multiple pattern Cartesian tree matching ⋮ Searching for a set of correlated patterns ⋮ Fast Average-Case Pattern Matching on Weighted Sequences ⋮ On the string matching with \(k\) mismatches ⋮ WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING ⋮ An aggressive algorithm for multiple string matching ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Streaming Dictionary Matching with Mismatches ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations ⋮ Streaming dictionary matching with mismatches