Accelerating boyer moore searches on binary texts

Shmuel T. Klein, Miri Kopel Ben-Nissan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 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 precomputed 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
Title of host publicationImplementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540763352
StatePublished - 2007
Event12th International Conference on Implementation and Application of Automata, CIAA 2007 - Prague, Switzerland
Duration: 16 Jul 200718 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4783 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on Implementation and Application of Automata, CIAA 2007


  • 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