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>.

Package details

AuthorKevin R. Coombes
MaintainerKevin R. Coombes <[email protected]>
LicenseApache License (== 2.0)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the NameNeedle package in your browser

Any scripts or data that you put into this service are public.

NameNeedle documentation built on May 2, 2019, 12:32 p.m.