Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874116 | Information Processing Letters | 2018 | 4 Pages |
Abstract
- 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Abdullah N. Arslan,