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

DOI10.1007/S11786-010-0035-4zbMATH Open1205.68526OpenAlexW2080104421MaRDI QIDQ626897FDOQ626897

Authors: 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

Recommendations

• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Increased bit-parallelism for approximate and multiple string matching
• Alternative algorithms for bit-parallel string matching.
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Fast pattern matching method for a bitstream

zbMATH Keywords

pattern matchingbit-parallelismstring search

Mathematics Subject Classification ID

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

Cites Work

• Efficient string matching
• Title not available (Why is that?)
• Jewels of Stringology
• Title not available (Why is that?)
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• Title not available (Why is that?)
• Alternative algorithms for bit-parallel string matching.
• Average-optimal string matching
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching

Cited In (3)

• Fast and flexible packed string matching
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• BLIM

Uses Software

• SPARE Parts

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

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