W tatatata dv w8 computing hamming distance is a

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n op1mal alignment always significant? Edit Distance Levenshtein (1966) introduced edit distance between two strings as the minimum number of elementary operations (insertions, deletions, and substitutions) to transform one string into the other d(v, w): the minimum number of operations required to transform v into w. Edit Distance vs Hamming Distance Hamming distance always compares the ith leder of v with the jth leder of w V = ATATATAT! W = TATATATA! d(v, w)=8 computing Hamming distance is a trivial task Edit distance may compare the ith leder of v with the jth leder of w V = -ATATATAT! W = TATATATA-! d(v, w)=2 computing edit distance is a non-trivial task Edit Distance vs Hamming Distance Hamming distance always compares the ith leder of v with the jth leder of w V = ATATATAT! W = TATATATA! d(v, w)=8 Edit distance may compare the ith leder of v with the jth leder of w V = -ATATATAT! W = TATATATA-! d(v, w)=2 (o...
View Full Document

This note was uploaded on 02/10/2014 for the course CS 680 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online