Which of the following is an application of the edit distance problem?
(a) Approximate string matching
(b) Spelling correction
(c) Similarity of DNA
(d) Approximate string matching, Spelling Correction and Similarity of DNA
This question was addressed to me in my homework.
My question is taken from Edit Distance Problem topic in section Dynamic Programming of Data Structures & Algorithms II