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

Search this Article

Author(s)

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

  • J. of Information Proc.

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

    Information Processing Society of Japan (IPSJ)

Cited by:  1

Codes

  • NII Article ID (NAID)
    110002673445
  • NII NACSIS-CAT ID (NCID)
    AA00700121
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    03876101
  • Data Source
    CJPref  NII-ELS 
Page Top