Nothing
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 |
|
---|---|
Author | Kevin R. Coombes [aut, cre] |
Maintainer | Kevin R. Coombes <krc@silicovore.com> |
License | Apache License (== 2.0) |
Version | 1.2.8 |
URL | http://oompa.r-forge.r-project.org/ |
Package repository | View on CRAN |
Installation |
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.