1000000 strings problem!

Revision en1, by rezzaque, 2016-08-01 12:23:20

Hello everyone! I encountered a problem at work. I have to search from 1000000 strings that are built from only 0's and 1's if any of them is at least %80 percent similar to an arbitrarily given string. By similarity I mean hamming distance. The thing is linear searching is no good enough to make it in at least 0.2 seconds. All strings are of the same length which is 64 characters. Any help or suggestion is welcome, have a nice day!

Tags hamming, searching

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English rezzaque 2016-08-01 12:23:20 460 Initial revision (published)