Improving practical exact string matching

DOI10.1016/J.IPL.2009.11.010zbMATH Open1209.68171OpenAlexW1968655052MaRDI QIDQ990135FDOQ990135

Authors: Branislav Ďurian, Jan Holub, Hannu Peltola, 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

Recommendations

• Tuning BNDM with \(q\)-grams
• Alternative algorithms for bit-parallel string matching.
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Efficient variants of the backward-oracle-matching algorithm
• String matching with lookahead

zbMATH Keywords

algorithmsstring matchingbit-parallelismexperimental comparison

Mathematics Subject Classification ID

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

Cites Work

• A fast string searching algorithm
• Title not available (Why is that?)
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Fast exact string matching algorithms
• Shift-or string matching with super-alphabets
• Alternative algorithms for bit-parallel string matching.
• NR-grep: A fast and flexible pattern-matching tool
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• The wide window string matching algorithm

Cited In (18)

• Top-k Substring Matching for Auto-Completion
• Order-preserving pattern matching indeterminate strings
• Order-preserving pattern matching indeterminate strings
• Generalized String Matching
• Improved and self-tuned occurrence heuristics
• Average complexity of backward \(q\)-gram string matching algorithms
• Efficient variants of the backward-oracle-matching algorithm
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• Tuning BNDM with \(q\)-grams
• Alternative algorithms for bit-parallel string matching.
• A filtration method for order-preserving matching
• String matching with lookahead
• Fast Cartesian tree matching
• Improved online algorithms for jumbled matching
• Title not available (Why is that?)
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Lyndon factorization algorithms for small alphabets and run-length encoded strings

This page was built for publication: Improving practical exact string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990135)