SP8769 STRDIST2 - String distance

Prof.XYZ is an expert in sequence analysis. One such problem he works on is bar-coding DNA sequences. The problem at hand is, given two DNA sequences, find a way to compute their similarity efficiently. Formally a DNA sequence is a string (S) of length N where each character is from a set of symbols derived from a vocabulary ∑. We define the m-perturbed set of a string S to be Δ(S,m) which contains the set of all strings S' obtained by changing atmost m characters of S with m

N/A

N/A