algorithms for fast string approximate matching -
given source string s , n equal length strings, need find quick algorithm return strings have @ k characters different source string s @ each corresponding position.
what fast algorithm so?
ps: have claim academic question. want find efficient algorithm if possible.
also missed 1 important piece of information. n equal length strings form dictionary, against many source strings s queried upon. there seems sort of preprocessing step make more efficient.
my gut instinct iterate on each string n, maintaining counter of how many characters different s, i'm not claiming efficient solution. o(n) unless known performance problem, or academic question, i'd go that.
Comments
Post a Comment