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>.
https://anaconda.org/r/r-nameneedle/badges/version.svg
https://anaconda.org/r/r-nameneedle/badges/latest_release_date.svg
https://anaconda.org/r/r-nameneedle/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-nameneedle/badges/platforms.svg
https://anaconda.org/r/r-nameneedle/badges/license.svg
https://anaconda.org/r/r-nameneedle/badges/downloads.svg