Accelerating Boyer-Moore searches on binary texts

DOI10.1016/j.tcs.2009.03.019zbMath1194.68141OpenAlexW2028455964MaRDI QIDQ840783

Shmuel T. Klein, Miri Kopel Ben-Nissan

Publication date: 14 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.019

zbMATH Keywords

pattern matchingBDMbinary textsBoyer-Moorecompressed matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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