On Improving the Average Case of the Boyer-Moore String Matching Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• It is shown how to modify the Boyer-Moore string matching algorithm so that the number of characters actually inspected and the running time decrease sharply as the length of pattern gets longer.

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

著者

• Takaoka Tadao

  Department Of Computer Science Ibaraki University

• Takaoka T

  Ibaraki Univ. Ibaraki Jpn

• Feng Zhu

  Department Of Information Science Ibaraki University

• Takaoka Tadao

  Department of Computer Science and Software Engineering University of Canterbury

関連論文

• A Parallel Algorithm for the Longest Path Problem on Acyclic Graphs with Integer Arc Lengths
• A Systematic Approach to Parallel Program Verification
• On Improving the Average Case of the Boyer-Moore String Matching Algorithm
• Parallel Algorithms for a Class of Graph Theoretic Problems
• The Extension of the Aho-Corasick Algorithm to Multiple Rectangular Pattern Arrays of Different Sizes and N-Dimensional Cases
• Entropy as Computational Complexity
• An O(n(n^2/p+log p)) Parallel Algorithm to Compute the All Pairs Shortest Paths and the Transitive Closure

スポンサーリンク