Skip to search formSkip to main contentSkip to account menu

Boyer–Moore string search algorithm

Known as: Moore, Boyer (disambiguation), Boyer–Moore 
In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
AlgorithmAlgorithmic efficiencyApostolico–Giancarlo algorithmBoost

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Analysis of Parallel Boyer-Moore String Search Algorithm
Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms. Widely, it is used in… 
2012
2012
Multiple Pattern String Matching Methodologies: A Comparative Analysis
String matching algorithms in software applications like virus scanners (anti-virus) or intrusion detection systems is stressed… 
2009
2009
FAUST: Forensic artifacts of uninstalled steganography tools
2006
2006
New vistas in Neotropical stream ecology—Preface
Most of our current models for stream nutrient dynamics, decomposition, and regulation of community structure have been derived… 
2006
2006
An improved Wu-Manber multiple patterns matching algorithm
NIDS is a powerful tool to defense the malicious attacks over the Internet. For the purpose of detecting the attack online, NIDS… 
2005
2005
Adaptive and Robust Design for PID Controller Based on Ant System Algorithm
In this paper, a novel optimal design method for PID controller is proposed based on the ant system (AS) algorithm. In this… 
2002
2002
SOCIAL REPRESENTATIONS OF LANGUAGES AND TEACHING Guide for the Development of Language Education Policies in Europe From Linguistic Diversity to Plurilingual Education Reference Study
2 The opinions expressed in this work are those of t he author and do not necessarily reflect the official policy of the Council… 
1994
1994
A proof of the nonrestoring division algorithm and its implementation on an ALU
This article describes a proof of the functional correctness of a nonrestoring division algorithm and its implementation on an… 
1990
1990
An Analysis of the Karp-Rabin String Matching Algorithm
Highly Cited
1977
Highly Cited
1977
On the Worst-Case Behavior of String-Searching Algorithms
  • R. Rivest
  • SIAM journal on computing (Print)
  • 1977
  • Corpus ID: 17128836
Any algorithm for finding a pattern of length k in a string of length n must examine at least $n - k + 1$ of the characters of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)