Analysis of Boyer-Moore-Horspool string-matching heuristic
From MaRDI portal
Publication:3122912
DOI<169::AID-RSA9>3.0.CO;2-T 10.1002/(SICI)1098-2418(199701/03)10:1/2<169::AID-RSA9>3.0.CO;2-TzbMath0872.60007OpenAlexW2042442617MaRDI QIDQ3122912
Hosam M. Mahmoud, Mireille Régnier, Robert T. Smythe
Publication date: 1 October 1997
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<169::aid-rsa9>3.0.co;2-t
Related Items
The Boyer-Moore-Horspool heuristic with Markovian input ⋮ Optimal pattern matching algorithms ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ An algorithm to compute the character access count distribution for pattern matching algorithms ⋮ Designing optimal- and fast-on-average pattern matching algorithms ⋮ Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
Cites Work
This page was built for publication: Analysis of Boyer-Moore-Horspool string-matching heuristic