Accelerating Boyer Moore Searches on Binary Texts

DOI10.1007/978-3-540-76336-9_14zbMath1139.68367OpenAlexW1565451641MaRDI QIDQ3503901

Shmuel T. Klein, Miri Kopel Ben-Nissan

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_14

zbMATH Keywords

pattern matchingBDMbinary textsBoyer-Moorecompressed matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (4)

Towards optimal packed string matching ⋮ Fast searching in packed strings ⋮ Boosting Pattern Matching Performance via k-bit Filtering ⋮ Fast Searching in Packed Strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• String Processing and Information Retrieval

This page was built for publication: Accelerating Boyer Moore Searches on Binary Texts