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
Suggests: testthat
Published: 2015-04-29
Author: Shaun Jackman [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

Downloads:

Reference manual: uniqtag.pdf
Package source: uniqtag_1.0.tar.gz
Windows binaries: r-devel: uniqtag_1.0.zip, r-release: uniqtag_1.0.zip, r-oldrel: uniqtag_1.0.zip
OS X binaries: r-release: uniqtag_1.0.tgz, r-oldrel: uniqtag_1.0.tgz

Linking:

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