Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Boyer–Moore–Horspool algorithm · Vinony

Boyer–Moore–Horspool algorithm

EntityQ4060665· pop 6· linked from 59 articles

Boyer–Moore–Horspool algorithm

Sign in to save

string search algorithm

Key dates

Published: 1980

via Wikidata · CC0

Wikidata facts

Based on: Boyer–Moore string search algorithm

via Wikidata · CC0

Connections

Best, worst and average case

computer science

Categories

String matching algorithms

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

algorithm

Entity

digital object identifier

regular expression

Levenshtein distance

Hamming distance

sequence alignment

time complexity

nondeterministic finite automaton

Knuth–Morris–Pratt algorithm

What links here59 pages

longest common substring problem

sequence mining

longest common subsequence problem

nondeterministic finite automaton

Aho–Corasick algorithm

Boyer–Moore string search algorithm

Hirschberg's algorithm

regular expression

Levenshtein distance

ternary search tree

bitap algorithm

Hamming distance

Knuth–Morris–Pratt algorithm

Damerau–Levenshtein distance

Jaro–Winkler distance

string-searching algorithm

regular grammar

Markov algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Common Scrambling Algorithm

Entitydist 0.54

Entitydist 0.58

Entitydist 0.62

Entitydist 0.65

Entitydist 0.66

Entitydist 0.66

Entitydist 0.67

Template:Introduction to Algorithms

Entitydist 0.67

Category:Bioinformatics algorithms

Entitydist 0.68

content-addressable memory

Entitydist 0.68

massive parallel sequencing

Entitydist 0.68

Entitydist 0.68