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>.
Version: | 1.2.6 |
Depends: | R (≥ 3.0) |
Imports: | stats |
Suggests: | Biostrings |
Published: | 2020-03-23 |
Author: | Kevin R. Coombes |
Maintainer: | Kevin R. Coombes <krc at silicovore.com> |
License: | Apache License (== 2.0) |
URL: | http://oompa.r-forge.r-project.org/ |
NeedsCompilation: | no |
Materials: | NEWS |
CRAN checks: | NameNeedle results |
Reference manual: | NameNeedle.pdf |
Vignettes: |
NameNeedle |
Package source: | NameNeedle_1.2.6.tar.gz |
Windows binaries: | r-devel: NameNeedle_1.2.6.zip, r-release: NameNeedle_1.2.6.zip, r-oldrel: NameNeedle_1.2.6.zip |
macOS binaries: | r-release (arm64): NameNeedle_1.2.6.tgz, r-oldrel (arm64): NameNeedle_1.2.6.tgz, r-release (x86_64): NameNeedle_1.2.6.tgz, r-oldrel (x86_64): NameNeedle_1.2.6.tgz |
Old sources: | NameNeedle archive |
Please use the canonical form https://CRAN.R-project.org/package=NameNeedle to link to this page.