Extended Data Fig. 4: Details of fuzzy seed-and-vote algorithm.
From: Real-time raw signal genomic analysis using fully integrated memristor hardware
If the hashing bits are adjacent in input, they should also be adjacent in corresponding reference memory. Hashing bits can tolerate some errors; if the input signal has a small cosine distance due to noise, the output hashing bits will likely have a small Hamming distance as well. This allows the data to be hashed into the same bucket with high probability. Additionally, CAM performs approximate searches rather than exact matches. CAM uses fuzzy searches based on Hamming distance to ensure that data hashed into nearby spaces still be considered as match.
