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.

Rabin–Karp algorithm · Vinony

EntityQ1384131· pop 18· linked from 67 articles

Rabin–Karp algorithm

Sign in to save

string searching algorithm

Connections

Richard M. Karp

time complexity

string-searching algorithm

computer science

International Standard Book Number

digital object identifier

regular expression

modular arithmetic

Levenshtein distance

Michael O. Rabin

Hamming distance

Categories

Hashing String matching algorithms

Sources

wikipedia.externallinksexternallink

What links here67 pages

longest common substring problem

Michael O. Rabin

content similarity detection

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

Similar entities

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

approximate string-matching algorithm

Entitydist 0.38

longest prefix match

Entitydist 0.45

Markov algorithm

Entitydist 0.53

Tomasulo algorithm

Entitydist 0.56

Risch algorithm

Entitydist 0.58

Hopcroft–Karp algorithm

Entitydist 0.58

Kaprekar's constant

Entitydist 0.59

Berlekamp–Welch algorithm

Entitydist 0.59

Kaddare alphabet

Entitydist 0.59

Entitydist 0.60

Fletcher's checksum

Entitydist 0.60

Maxam-Gilbert sequencing

Entitydist 0.61