FastHamming: Fast Computation of Pairwise Hamming Distances
Pairwise Hamming distances are computed between the rows of a binary (0/1) matrix using highly optimized C code. The input is an integer matrix where each row represents a binary feature vector and returns a symmetric integer matrix of pairwise distances. Internally, rows are bit-packed into 64-bit words for fast XOR-based comparisons, with hardware-accelerated popcount operations to count differences. OpenMP parallelization ensures efficient performance for large matrices.
| Version: |
1.1 |
| Depends: |
R (≥ 4.0.0) |
| Published: |
2025-04-25 |
| DOI: |
10.32614/CRAN.package.FastHamming |
| Author: |
Ravi Varadhan [aut, cre] |
| Maintainer: |
Ravi Varadhan <ravi.varadhan at jhu.edu> |
| License: |
GPL-3 |
| NeedsCompilation: |
yes |
| SystemRequirements: |
C compiler (C99), OpenMP |
| CRAN checks: |
FastHamming results [issues need fixing before 2025-05-09] |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=FastHamming
to link to this page.