Fast practical multi-pattern matching
From MaRDI portal
Publication:1606976
DOI10.1016/S0020-0190(99)00092-7zbMath0999.68246WikidataQ61677971 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
68W05: Nonnumerical algorithms
68U15: Computing methodologies for text processing; mathematical typography
Related Items
Streaming Dictionary Matching with Mismatches, On the Structure of Consistent Partitions of Substring Set of a Word, Fast Average-Case Pattern Matching on Weighted Sequences, Searching for a set of correlated patterns, An aggressive algorithm for multiple string matching, A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms, A fast algorithm for the all-pairs suffix-prefix problem, On the string matching with \(k\) mismatches, Average complexity of exact and approximate multiple string matching, Streaming dictionary matching with mismatches, Fast algorithms for single and multiple pattern Cartesian tree matching, Sequential and indexed two-dimensional combinatorial template matching allowing rotations, WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING
