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

• FENG Z. -R.

  Department of Information Science, Ibaraki University

• TAKAOKA TADAO

  Department of Information Science, Ibaraki University

抄録

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.

収録刊行物

• J. of Information Proc.

  J. of Information Proc. 10 173-177, 1988

  一般社団法人情報処理学会

詳細情報

• CRID: 1572261552009510272
• NII論文ID: 110002673445
• NII書誌ID: AA00700121
• ISSN: 03876101
• 本文言語コード: en
• データソース種別:
  • CiNii Articles