About Anaconda Help Download Anaconda

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.

copied from cf-staging / r-uniqtag
Type Size Name Uploaded Downloads Labels
conda 26.0 kB | noarch/r-uniqtag-1.0-r40hc72bb7e_1002.tar.bz2  3 years and 7 months ago 1958 main
conda 26.0 kB | noarch/r-uniqtag-1.0-r41hc72bb7e_1002.tar.bz2  3 years and 7 months ago 1970 main
conda 25.6 kB | noarch/r-uniqtag-1.0-r40h6115d3f_1002.tar.bz2  4 years and 8 months ago 2767 main
conda 25.8 kB | noarch/r-uniqtag-1.0-r36h6115d3f_1002.tar.bz2  4 years and 8 months ago 2782 main
conda 25.5 kB | noarch/r-uniqtag-1.0-r36h6115d3f_1001.tar.bz2  5 years and 5 months ago 3646 main cf202003
conda 25.3 kB | noarch/r-uniqtag-1.0-r35h6115d3f_1001.tar.bz2  5 years and 5 months ago 3609 main cf202003
conda 24.9 kB | noarch/r-uniqtag-1.0-r351h6115d3f_1000.tar.bz2  6 years and 4 days ago 4098 main cf202003 gcc7 cf201901
conda 25.4 kB | noarch/r-uniqtag-1.0-r351h6115d3f_0.tar.bz2  6 years and 4 days ago 4115 main cf202003 cf201901

© 2025 Anaconda, Inc. All Rights Reserved. (v4.0.6) Legal | Privacy Policy