Accelerating Boyer-Moore searches on binary texts

Shmuel T. Klein, Miri Kopel Ben-Nissan

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blocks such as bytes or words, thereby significantly reducing the number of comparisons. Empirical comparisons show that the new variant performs better than regular binary BM and even than BDM.

Original languageEnglish
Pages (from-to)3563-3571
Number of pages9
JournalTheoretical Computer Science
Issue number37
StatePublished - 1 Sep 2009


  • BDM
  • Binary texts
  • Boyer-Moore
  • Compressed matching
  • Pattern matching


Dive into the research topics of 'Accelerating Boyer-Moore searches on binary texts'. Together they form a unique fingerprint.

Cite this