News for hackers. Stuff that matters.
Re:Optimizing CRISPR: Sub-second searches on a 3 billion bas... by ticking on Thursday July 23, 2015 @10:21PM (#9939793)
Have you thought about using the hammond distance, instead of the array?

It should give you the same answer in 3 CPU instructions on registers instead of 2 array lookups and arithmetic in ram. XOR, hammond weight/bitcount and and equality check.

Re:Optimizing CRISPR: Sub-second searches on a 3 billion bas... by vineetg on Thursday July 23, 2015 @11:14PM (#9939951)
We actually do this in our "expensive" check. The reason that we use the 2 arrays is because in 2 array lookups, we can check for matches for all 200 guides. I probably could've made that clearer in the post - the array contains matches for ALL of the guides.