K
K3
I am a newbie to perl, so i wud appreciate if anyone give the code for
finding the number of matches in a given string, allowing atmost m no
of mismatches.
input: short string (len = k)
long string (len =n)
no of mismatches (=m)
cheers
karthik
finding the number of matches in a given string, allowing atmost m no
of mismatches.
input: short string (len = k)
long string (len =n)
no of mismatches (=m)
cheers
karthik