A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching

DOI10.1007/978-3-540-92182-0_45MaRDI QIDQ3596744zbMATH OpenOpenAlexFDO

Authors M. Oğuzhan Külekci

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_45

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
• A fast bit-parallel algorithm for matching extended regular expressions
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Increased bit-parallelism for approximate and multiple string matching
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Alternative algorithms for bit-parallel string matching.

Cited in

(5)

• Improving practical exact string matching
• Boosting pattern matching performance via \(k\)-bit filtering
• Fast pattern matching method for a bitstream
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet

This page was built for publication: A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching

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