A Bit-Parallel Exact String Matching Algorithm for Small Alphabet

DOI10.1007/978-3-642-02270-8_34zbMath1248.68578OpenAlexW1570238230MaRDI QIDQ5321726

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

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

string matchingmatching tablematching matrixbit-parallel

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Uses Software

• Canterbury

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast exact string matching algorithms
• Shift-or string matching with super-alphabets
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata

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