TY - JOUR
T1 - Accelerating Boyer-Moore searches on binary texts
AU - Klein, Shmuel T.
AU - Kopel Ben-Nissan, Miri
PY - 2009/9/1
Y1 - 2009/9/1
N2 - 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.
AB - 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.
KW - BDM
KW - Binary texts
KW - Boyer-Moore
KW - Compressed matching
KW - Pattern matching
UR - http://www.scopus.com/inward/record.url?scp=67651119980&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2009.03.019
DO - 10.1016/j.tcs.2009.03.019
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0304-3975
VL - 410
SP - 3563
EP - 3571
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 37
ER -