A Bit-Parallel Exact String Matching Algorithm for Small Alphabet

DOI10.1007/978-3-642-02270-8_34MaRDI QIDQ5321726zbMATH OpenOpenAlexFDO

Authors Guo Min Zhang, En Zhu, Ling Mao, Ming Yin

Publication date 14 July 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02270-8_34

zbMATH Keywords

bit-parallelmatching matrixmatching tablestring matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• Alternative algorithms for bit-parallel string matching.
• Bit-parallel approximate string matching algorithms with transposition
• Bit-parallel approximate string matching algorithms with transposition.
• scientific article; zbMATH DE number 2087055
• Approximate Boyer-Moore string matching for small alphabets
• Bit-parallel witnesses and their applications to approximate string matching
• A constant-time optimal parallel string-matching algorithm
• Increased bit-parallelism for approximate and multiple string matching
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

Cites work

• A fast string searching algorithm
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Efficient randomized pattern-matching algorithms
• Efficient variants of the backward-oracle-matching algorithm
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Fast exact string matching algorithms
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 1794216 (Why is no real title available?)
• Shift-or string matching with super-alphabets
• Speeding up two string-matching algorithms

Cited in

(4)

• Shift-or string matching with super-alphabets
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• String Processing and Information Retrieval
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation

Describes a project that uses

Uses Software

• Canterbury

This page was built for publication: A Bit-Parallel Exact String Matching Algorithm for Small Alphabet

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