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

Home
Bioinformatics algorithms
ขั้นตอนวิธีของเฮิร์ชเบิร์ก

🌐ไทย

English Deutsch Italiano فارسی ไทย

EntityQ1620364· pop 6· linked from 57 articles

ขั้นตอนวิธีของเฮิร์ชเบิร์ก

algorithm

Available in 6 languages

Deutsch
Italiano
Serbian
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

longest common subsequence problem

computer science

Categories

Bioinformatics algorithms Dynamic programming Sequence alignment algorithms

Sources

wikipedia.externallinksexternallink

deoxyribonucleic acid

Entity

digital object identifier

regular expression

dynamic programming

Levenshtein distance

Hamming distance

sequence alignment

computational biology

nondeterministic finite automaton

Sign in to save

What links here57 pages

longest common substring problem

sequence mining

longest common subsequence problem

nondeterministic finite automaton

Aho–Corasick algorithm

Boyer–Moore string search 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

dynamic time warping

Markov algorithm

Similar entities

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

Entitydist 0.43

Entitydist 0.46

Entitydist 0.46

Entitydist 0.47

Entitydist 0.49

Entitydist 0.50

Entitydist 0.51

Aleksander Hirschberg

Entitydist 0.51

Kasriel Hirsch Sarasohn

Entitydist 0.51

Neville's algorithm

Entitydist 0.51

Entitydist 0.51

Entitydist 0.51