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.

Version: 1.0.1
Suggests: testthat
Published: 2022-06-10
Author: Shaun Jackman [aut, cph, cre]
Maintainer: Shaun Jackman <sjackman at gmail.com>
BugReports: https://github.com/sjackman/uniqtag/issues
License: MIT + file LICENSE
URL: https://github.com/sjackman/uniqtag
NeedsCompilation: no
Materials: README
CRAN checks: uniqtag results


Reference manual: uniqtag.pdf


Package source: uniqtag_1.0.1.tar.gz
Windows binaries: r-devel: uniqtag_1.0.1.zip, r-release: uniqtag_1.0.1.zip, r-oldrel: uniqtag_1.0.1.zip
macOS binaries: r-release (arm64): uniqtag_1.0.1.tgz, r-oldrel (arm64): uniqtag_1.0.1.tgz, r-release (x86_64): uniqtag_1.0.1.tgz, r-oldrel (x86_64): uniqtag_1.0.1.tgz
Old sources: uniqtag archive

Reverse dependencies:

Reverse imports: openPrimeR


Please use the canonical form https://CRAN.R-project.org/package=uniqtag to link to this page.