BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation

DOI10.1007/s11786-010-0035-4zbMath1205.68526OpenAlexW2080104421MaRDI QIDQ626897

M. Oğuzhan Külekci

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-010-0035-4

zbMATH Keywords

pattern matchingbit-parallelismstring search

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Algorithms on strings (68W32)

Related Items (2)

Fast and flexible packed string matching ⋮ BLIM

Uses Software

• SPARE Parts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• Average-optimal string matching
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Efficient string matching
• Jewels of Stringology
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval

This page was built for publication: BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation