@inproceedings{8357762af9264a2bb44917ee21f4bd17,
title = "Accelerating boyer moore searches on binary texts",
abstract = "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.",
keywords = "BDM, Binary texts, Boyer-Moore, Compressed matching, Pattern matching",
author = "Klein, {Shmuel T.} and Ben-Nissan, {Miri Kopel}",
year = "2007",
doi = "10.1007/978-3-540-76336-9_14",
language = "אנגלית",
isbn = "9783540763352",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "130--143",
booktitle = "Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers",
address = "גרמניה",
note = "12th International Conference on Implementation and Application of Automata, CIAA 2007 ; Conference date: 16-07-2007 Through 18-07-2007",
}