The team also developed a deterministic algorithm for a problem called Text-to-Pattern Hamming Distances, where you count the mismatches between a text string & a pattern string at every position. It runs nearly as fast as the previous best-randomized algorithm.

→ View original post on X — @mit_csail,