Comment
enIn computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.
Has abstract
enIn computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.
Hypernym
Algorithm
Is primary topic of
Wagner–Fischer algorithm
Label
enWagner–Fischer algorithm
Link from a Wikipage to another Wikipage
Big O notation
Category:Algorithms on strings
Category:String metrics
Computer science
Data dependency
David Sankoff
Dynamic programming
Edit distance
Flood fill
Fuzzy string searching
Invariant (mathematics)
Lazy evaluation
Levenshtein distance
Matrix (mathematics)
Michael J. Fischer
Multiple invention
Needleman–Wunsch algorithm
Parallel computing
Prefix (computer science)
Pseudocode
Reductio ad absurdum
Taras Vintsiuk
SameAs
2dnbW
Algorithme de Wagner-Fischer
m.0dsfbq7
Q2835818
Vagner-Fišerov algoritam
الگوریتم واگنر–فیشر
Subject
Category:Algorithms on strings
Category:String metrics
WasDerivedFrom
Wagner–Fischer algorithm?oldid=1117965265&ns=0
WikiPageLength
9866
Wikipage page ID
29320010
Wikipage revision ID
1117965265
WikiPageUsesTemplate
Template:Reflist
Template:Rp
Template:Strings
Template:Tooltip