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)
|Author||Kevin R. Coombes|
|Date of publication||2017-07-11 17:36:20|
|Maintainer||Kevin R. Coombes <email@example.com>|
|License||Apache License (== 2.0)|
|Package repository||View on R-Forge|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.