There is a database with N fixed length strings. There is a query string of the same length. The problem is to fetch first k strings from the database that have the smallest Hamming distance to q. how can I do this without traverse the whole database?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
-1
|
||||||||||||||||
|
closed as off topic by Will Jagy, David Roberts, Willie Wong, Chris Godsil, suVRit Feb 16 2012 at 16:52 |
