A Boyer-Moore-Horspool algorithm derivation

L.G.W.A. Cleophas, B.W. Watson

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review


    The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy allowed one to easily compare the different algorithms, and to easily implement them in a taxonomy-based toolkit. The taxonomy and toolkit did not include a variant of the Boyer-Moore algorithm developed by Horspool. In this paper, we present the Boyer-Moore-Horspool algorithm and its multiple keyword generalization in the context of the taxonomy.
    Originele taal-2Engels
    Pagina's (van-tot)13-20
    TijdschriftSouth African Computer Journal
    StatusGepubliceerd - 2008


    Duik in de onderzoeksthema's van 'A Boyer-Moore-Horspool algorithm derivation'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit