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.

Documentation

Manual: uniqtag.pdf
Vignette: None available.

Maintainer: Shaun Jackman <sjackman at gmail.com>

Author(s): Shaun Jackman*

Install package and any missing dependencies by running this line in your R console:

install.packages("uniqtag")

Depends
Imports
Suggests testthat
Enhances
Linking to
Reverse
depends
Reverse
imports
Reverse
suggests
Reverse
enhances
Reverse
linking to

Package uniqtag
Materials
URL https://github.com/sjackman/uniqtag
Task Views
Version 1.0
Published 2015-04-29
License MIT + file LICENSE
BugReports https://github.com/sjackman/uniqtag/issues
SystemRequirements
NeedsCompilation no
Citation
CRAN checks uniqtag check results
Package source uniqtag_1.0.tar.gz