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 28.2 kB | noarch/r-uniqtag-1.0.1-r43hc72bb7e_3.conda  8 months and 9 days ago 719 main
conda 28.3 kB | noarch/r-uniqtag-1.0.1-r44hc72bb7e_3.conda  8 months and 9 days ago 673 main
conda 28.0 kB | noarch/r-uniqtag-1.0.1-r43hc72bb7e_2.conda  1 year and 8 months ago 1143 main
conda 27.9 kB | noarch/r-uniqtag-1.0.1-r42hc72bb7e_2.conda  1 year and 8 months ago 1105 main
conda 28.0 kB | noarch/r-uniqtag-1.0.1-r42hc72bb7e_1.tar.bz2  2 years and 5 months ago 1425 main
conda 27.9 kB | noarch/r-uniqtag-1.0.1-r41hc72bb7e_1.tar.bz2  2 years and 5 months ago 1422 main
conda 27.1 kB | noarch/r-uniqtag-1.0.1-r40hc72bb7e_0.tar.bz2  2 years and 9 months ago 1940 main
conda 27.1 kB | noarch/r-uniqtag-1.0.1-r41hc72bb7e_0.tar.bz2  2 years and 9 months ago 1926 main

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