On the Preprocessing Algorithm Used in the Boyer-Moore Algorithm for String Searching

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the preprocessing algorithm for Boyer-Moore string-searching. This paper proposes a natural preprocessing algorithm coming to our mind. The average running time per pattern of length m is proved to be O(m+m^2/q) under the assumption that q possible characters appear uniformly. The computer experiments show that the average running time per pattern of our algorithm is better than previous algorithms proposed.

• 一般社団法人情報処理学会の論文
• 1987-03-15

著者

• Semba Ichiro

  College Of General Education Ibaraki University

関連論文

• On the Preprocessing Algorithm Used in the Boyer-Moore Algorithm for String Searching
• Combinatorial Algorithms Using Boolean Processing
• An Algorithm for Division of Large Integers

スポンサーリンク