A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
CoRR(2024)
摘要
String matching is the problem of finding all the occurrences of a pattern in
a text. It has been intensively studied and the Boyer-Moore string matching
algorithm is probably one of the most famous solution to this problem. This
algorithm uses two precomputed shift tables called the good-suffix table and
the bad-character table. The good-suffix table is tricky to compute in linear
time. Text book solutions perform redundant operations. Here we present a fast
implementation for this good-suffix table based on a tight analysis of the
pattern. Experimental results show two versions of this new implementation are
the fastest in almost all tested situations.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要