Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

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

خوارزمية بوير-مور للبحث في السلاسل النصية · Vinony

🌐العربية

English Bahasa Indonesia Deutsch Español Français Italiano Nederlands Polski Português Türkçe Русский العربية فارسی ไทย 中文日本語

EntityQ895984· pop 20· linked from 73 articles

خوارزمية بوير-مور للبحث في السلاسل النصية

Also known as Boyer-Moore algorithm

string searching algorithm

Available in 19 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية

Connections

computer science

International Standard Book Number

Categories

Computer-related introductions in 1977 String matching algorithms

Sources

wikipedia.externallinksexternallink

Bahasa Indonesia

via Wikidata sitelinks · CC0

Q2407

Entity

digital object identifier

International Standard Serial Number

regular expression

Levenshtein distance

Hamming distance

sequence alignment

time complexity

Sign in to save

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