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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Klein, S. T., & Ben-Nissan, M. K. (2007). Accelerating boyer moore searches on binary texts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4783 LNCS, pp. 130–143). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_14
Mendeley helps you to discover research relevant for your work.