Nothing
uniqtag: Abbreviate Strings to Short, Unique Identifiers
For each string in a set of strings, determine a unique tag that is a substring of fixed size k unique to that string, if it has one. If no such unique substring exists, the least frequent substring is used. If multiple unique substrings exist, the lexicographically smallest substring is used. This lexicographically smallest substring of size k is called the "UniqTag" of that string.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Shaun Jackman [aut, cph, cre] |
| Maintainer | Shaun Jackman <sjackman@gmail.com> |
| License | MIT + file LICENSE |
| Version | 1.0.1 |
| URL | https://github.com/sjackman/uniqtag |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the uniqtag package in your browser
Any scripts or data that you put into this service are public.
