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.2 |
| Depends: | R (≥ 4.0.0) |
| Published: | 2025-04-27 |
| 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 |
| Reference manual: | FastHamming.html , FastHamming.pdf |
| Package source: | FastHamming_1.2.tar.gz |
| Windows binaries: | r-devel: FastHamming_1.2.zip, r-release: FastHamming_1.2.zip, r-oldrel: FastHamming_1.2.zip |
| macOS binaries: | r-release (arm64): FastHamming_1.2.tgz, r-oldrel (arm64): FastHamming_1.2.tgz, r-release (x86_64): FastHamming_1.2.tgz, r-oldrel (x86_64): FastHamming_1.2.tgz |
| Old sources: | FastHamming archive |
Please use the canonical form https://CRAN.R-project.org/package=FastHamming to link to this page.
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.