A fast algorithm for all-pairs Hamming distances

- AllPairsHamDist is introduced as the problem of computing Hamming distances for all pairs in two given sets.
- Solving an instance of AllPairHamDist yields a distance matrix that can be used for hierarchical clustering of biological sequences.
- For AllPairsHamDist, there exists a fast algorithm based on fast matrix multiplication.