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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
rolling linux/jammy R-4.5 | uniqtag_1.0.1.tar.gz |
20.5 KiB |
1.0.1 |
rolling linux/noble R-4.5 | uniqtag_1.0.1.tar.gz |
20.4 KiB |
1.0.1 |
rolling source/ R- | uniqtag_1.0.1.tar.gz |
5.2 KiB |
1.0.1 |
latest linux/jammy R-4.5 | uniqtag_1.0.1.tar.gz |
20.5 KiB |
1.0.1 |
latest linux/noble R-4.5 | uniqtag_1.0.1.tar.gz |
20.4 KiB |
1.0.1 |
latest source/ R- | uniqtag_1.0.1.tar.gz |
5.2 KiB |
1.0.1 |
2026-04-26 source/ R- | uniqtag_1.0.1.tar.gz |
5.2 KiB |
1.0.1 |
2026-04-23 source/ R- | uniqtag_1.0.1.tar.gz |
5.2 KiB |
1.0.1 |
2026-04-09 windows/windows R-4.5 | uniqtag_1.0.1.zip |
23.4 KiB |
1.0.1 |
2025-04-20 source/ R- | uniqtag_1.0.1.tar.gz |
5.2 KiB |