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 string search algorithm · Vinony

EntityQ895984· pop 20· linked from 73 articles

Boyer–Moore string search algorithm

Sign in to save

string searching algorithm

Connections

computer science

International Standard Book Number

digital object identifier

International Standard Serial Number

regular expression

Levenshtein distance

Hamming distance

sequence alignment

time complexity

Categories

Computer-related introductions in 1977 String matching algorithms

Sources

wikipedia.externallinksexternallink

What links here73 pages

longest common substring problem

sequence mining

longest common subsequence problem

nondeterministic finite automaton

Aho–Corasick algorithm

Hirschberg's algorithm

regular expression

Levenshtein distance

ternary search tree

bitap algorithm

Hamming distance

Knuth–Morris–Pratt algorithm

Damerau–Levenshtein distance

Boyer-Moore Majority Vote Algorithm

Jaro–Winkler distance

Robert S. Boyer

time complexity

Similar entities

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

Entitydist 0.57

Legge romanization

Entitydist 0.62

Google Code Search

Entitydist 0.62

Entitydist 0.62

incremental search

Entitydist 0.62

Entitydist 0.62

Entitydist 0.63

Entitydist 0.64

Category:Broken cryptography algorithms

Entitydist 0.64

Entitydist 0.64

private information retrieval

Entitydist 0.65

Hunterian transliteration

Entitydist 0.66