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

Search this article

Abstract

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.

Journal

Citations (1)*help

See more

Details 詳細情報について

  • CRID
    1572261552009510272
  • NII Article ID
    110002673445
  • NII Book ID
    AA00700121
  • ISSN
    03876101
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top