Crandore Hub

NameNeedle

Using Needleman-Wunsch to Match Sample Names

The Needleman-Wunsch global alignment algorithm can be used to find approximate matches between sample names in different data sets. See Wang et al. (2010) <doi:10.4137/CIN.S5613>.

Versions across snapshots

VersionRepositoryFileSize
1.2.10 rolling linux/jammy R-4.5 NameNeedle_1.2.10.tar.gz 116.1 KiB
1.2.10 rolling linux/noble R-4.5 NameNeedle_1.2.10.tar.gz 116.0 KiB
1.2.10 rolling source/ R- NameNeedle_1.2.10.tar.gz 104.1 KiB
1.2.10 latest linux/jammy R-4.5 NameNeedle_1.2.10.tar.gz 116.1 KiB
1.2.10 latest linux/noble R-4.5 NameNeedle_1.2.10.tar.gz 116.0 KiB
1.2.10 latest source/ R- NameNeedle_1.2.10.tar.gz 104.1 KiB
1.2.10 2026-04-26 source/ R- NameNeedle_1.2.10.tar.gz 104.1 KiB
1.2.10 2026-04-23 source/ R- NameNeedle_1.2.10.tar.gz 104.1 KiB
1.2.10 2026-04-09 windows/windows R-4.5 NameNeedle_1.2.10.zip 120.1 KiB
1.2.8 2025-04-20 source/ R- NameNeedle_1.2.8.tar.gz 103.6 KiB

Dependencies (latest)

Imports

Suggests