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.

Knuth–Morris–Pratt algorithm · Vinony

EntityQ45285· pop 24· linked from 96 articles

Knuth–Morris–Pratt algorithm

Sign in to save

string searching algorithm

Connections

time complexity

computer science

International Standard Book Number

Wayback Machine

digital object identifier

regular expression

Dijkstra's algorithm

automata theory

Levenshtein distance

Categories

1970 in computing Donald Knuth String matching algorithms

Sources

wikipedia.externallinksexternallink

What links here96 pages

longest common substring problem

sequence mining

longest common subsequence problem

Computer Modern

nondeterministic finite automaton

Aho–Corasick algorithm

Hirschberg's algorithm

Boyer–Moore string search algorithm

regular expression

Levenshtein distance

ternary search tree

bitap algorithm

Hamming distance

Damerau–Levenshtein distance

Knuth's up-arrow notation

Jaro–Winkler distance

Similar entities

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

bitap algorithm

Entitydist 0.35

Category:String matching algorithms

Entitydist 0.43

Category:Algorithms on strings

Entitydist 0.44

Thompson's construction algorithm

Entitydist 0.46

Levenshtein distance

Entitydist 0.46

list of string quartet ensembles

Entitydist 0.57

Category:Parsing algorithms

Entitydist 0.57

Category:String theory

Entitydist 0.59

Chudnovsky algorithm

Entitydist 0.59

Entitydist 0.59

Category:String performance techniques

Entitydist 0.59

Entitydist 0.60