Skip to search formSkip to main contentSkip to account menu

Boyer–Moore–Horspool algorithm

Known as: Horspool, Horspool's algoritm for string matching, Boyer–Moore–Horspool 
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
During the past time information on internet increasing enormously which greed the attacker and invite them for attack. In order… 
2016
2016
We introduce the \textit{multi-view pattern matching} problem, where a text can have multiple views. Each view is a string of the… 
2013
2013
Every day the networks are expanding in very large scale and running in very high speed. The Intrusion Detection System (IDS… 
2011
2011
In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching… 
2011
2011
Planificarea eficientă este cheia performanţei aplicaţiilor Grid, aspect ce solicită asigurarea toleranţei la defecte si a… 
2009
2009
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been… 
2009
2009
In this paper, we define the i-largest number domination sequence and compute the number of i-largest number domination sequence… 
2009
2009
Firstly pattern matching is briefly introduced in this paper, followed by the analysis of some typical algorithms just as BM… 
2008
2008
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been… 
2008
2008
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been…