Given two strings, \"ABAT\" and \"BATA\", what\'s their Hamming distance (2 points) and Edit distance (3 points), respectively? Explain your answers. [5 points total]
Solution
Hamming distance : Number of positions at which the corresponding symbols are different.
\"ABAT\" and \"BATA\" = Hamming distance is 4 as all the four corresponding letters are different.
Edit Distance : minimum number of operations required to transform one string into the other. Usually the Levenshtein distance is said as edit distance. Its operations are the removal, insertion, or substitution of a character in the string.
The Edit distance between \"ABAT\" and \"BATA\" is 2.
1. Delete first \"A\" from \"ABAT\" --> \"BAT\"
2. Insert \"A\" at the end of \"BAT\" --> \"BATA\"
Required strings is obtained and hence 2 operations are only required. Thus edit distance is 2.
.
Given two strings- --ABAT-- and --BATA--- what-'s their Hamming distan.docx
1. Given two strings, "ABAT" and "BATA", what's their Hamming distance (2 points) and Edit
distance (3 points), respectively? Explain your answers. [5 points total]
Solution
Hamming distance : Number of positions at which the corresponding symbols are different.
"ABAT" and "BATA" = Hamming distance is 4 as all the four corresponding letters are
different.
Edit Distance : minimum number of operations required to transform one string into the other.
Usually the Levenshtein distance is said as edit distance. Its operations are the removal,
insertion, or substitution of a character in the string.
The Edit distance between "ABAT" and "BATA" is 2.
1. Delete first "A" from "ABAT" --> "BAT"
2. Insert "A" at the end of "BAT" --> "BATA"
Required strings is obtained and hence 2 operations are only required. Thus edit distance is 2.
![Given two strings, "ABAT" and "BATA", what's their Hamming distance (2 points) and Edit
distance (3 points), respectively? Explain your answers. [5 points total]
Solution
Hamming distance : Number of positions at which the corresponding symbols are different.
"ABAT" and "BATA" = Hamming distance is 4 as all the four corresponding letters are
different.
Edit Distance : minimum number of operations required to transform one string into the other.
Usually the Levenshtein distance is said as edit distance. Its operations are the removal,
insertion, or substitution of a character in the string.
The Edit distance between "ABAT" and "BATA" is 2.
1. Delete first "A" from "ABAT" --> "BAT"
2. Insert "A" at the end of "BAT" --> "BATA"
Required strings is obtained and hence 2 operations are only required. Thus edit distance is 2.](https://image.slidesharecdn.com/giventwostrings-abat-and-bata-what-stheirhammingdistan-230127190730-9d7e79f7/85/Given-two-strings-ABAT-and-BATA-what-s-their-Hamming-distan-docx-1-320.jpg)
