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

DOI10.1007/978-3-540-92182-0_45zbMath1183.68761OpenAlexW1502423809MaRDI QIDQ3596744

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)

Related Items (4)

A Bit-Parallel Exact String Matching Algorithm for Small Alphabet ⋮ BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation ⋮ Boosting Pattern Matching Performance via k-bit Filtering ⋮ Improving practical exact string matching

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