Improving practical exact string matching

DOI10.1016/j.ipl.2009.11.010zbMath1209.68171OpenAlexW1968655052MaRDI QIDQ990135

Branislav Ďurian, Hannu Peltola, Jan Holub, Jorma Tarhio

Publication date: 2 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.11.010

zbMATH Keywords

algorithmsstring matchingexperimental comparisonbit-parallelism

Mathematics Subject Classification ID

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

Related Items

Run-Length Encoded Nondeterministic KMP and Suffix Automata, A filtration method for order-preserving matching, Average complexity of backward \(q\)-gram string matching algorithms, Fast algorithms for single and multiple pattern Cartesian tree matching, String matching with lookahead, Lyndon factorization algorithms for small alphabets and run-length encoded strings, Improved online algorithms for jumbled matching, Unnamed Item, Order-preserving pattern matching indeterminate strings

Cites Work

• Unnamed Item
• Fast exact string matching algorithms
• Shift-or string matching with super-alphabets
• The wide window string matching algorithm
• NR‐grep: a fast and flexible pattern‐matching tool
• A fast string searching algorithm
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval