Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    A simple fast hybrid pattern-matching algorithm

    Access Status
    Open access via publisher
    Authors
    Smyth, William Fennell
    Franek, F.
    Jennings, C.
    Date
    2007
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Smyth, W.F. and Franek, F. and Jennings, C. 2007. A simple fast hybrid pattern-matching algorithm. Journal of Discrete Algorithms. 5 (4): pp. 682-695.
    Source Title
    Journal of Discrete Algorithms
    DOI
    10.1016/j.jda.2006.11.004
    ISSN
    15708667
    School
    Digital Ecosystems and Business Intelligence Institute (DEBII)
    URI
    http://hdl.handle.net/20.500.11937/7730
    Collection
    • Curtin Research Publications
    Abstract

    The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer–Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with a little help from Sunday) in an effort to combine these desirable features. Experiments indicate that in practice the new algorithm is among the fastest exact pattern-matching algorithms discovered to date, apparently dominant for alphabet size above 15–20.

    Related items

    Showing items related by title, author, creator and subject.

    • Relational evidence theory and spatial interpretation procedures.
      Pearce, Adrian (1996)
      Spatial interpretation involves the intelligent processing of images for learning, planning and visualisation. This involves building systems which learn to recognise patterns from the content of unconstrained data such ...
    • Distributed motion coordination for mobile wireless sensor networks using vision
      Lee, Justin (2003)
      Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These selforganising, distributed networks of sensors, processors and ...
    • An adaptive hybrid pattern-matching algorithm on indeterminate strings
      Smyth, Bill; Wang, S. (2009)
      We describe a hybrid pattern-matching algorithm that works on both regular and indeterminate strings. This algorithm is inspired by the recently proposed hybrid algorithm FJS and its indeterminate successor. However, as ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.