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.
- Version1.2.7
- R versionunknown
- LicenseApache License (== 2.0)
- Needs compilation?No
- Last release08/19/2023
Documentation
Team
Kevin R. Coombes
MaintainerShow author details
Insights
Last 30 days
This package has been downloaded 228 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 11 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 3,041 times in the last 365 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. The day with the most downloads was Jul 21, 2024 with 73 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN