Wagner-Fischer Algorithm

A Wagner-Fischer Algorithm is a dynamic programming edit distance algorithm.

• See: Edit Distance, Sequence Alignment Algorithm.

---

---

References

2021

• (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Wagner–Fischer_algorithm Retrieved:2021-3-4.
  • In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.

2015

• (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Wagner–Fischer_algorithm Retrieved:2015-8-17.
  • In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.

1975

• (Wagner, 1975) ⇒ Robert A. Wagner. (1975). “On the Complexity of the Extended String-to-string Correction Problem.” In: Proceedings of seventh annual ACM symposium on Theory of computing, pp. 218-223. ACM,

---