The Wagner-Fischer algorithm uses a matrix that is easily small enough to fit into an AVX2 register for many applications. An algorithm using AVX2 instructions would be interesting. However, it's not clear that we would see significant performance gains over the current optimized serial algorithm. I speculate that, at this point, there is more time spent in overhead than there is spent computing the edit distance.
The Wagner-Fischer algorithm uses a matrix that is easily small enough to fit into an AVX2 register for many applications. An algorithm using AVX2 instructions would be interesting. However, it's not clear that we would see significant performance gains over the current optimized serial algorithm. I speculate that, at this point, there is more time spent in overhead than there is spent computing the edit distance.