Cited in
(34)- Lower density selection schemes via small universal hitting sets with short remaining path length
- Representation of \(k\)-mer sets using spectrum-preserving string sets
- Efficient construction of a complete index for pan-genomics read alignment
- Fast approximation of frequent \(k\)-mers and applications to metagenomics
- Effective parallel multicore-optimized \(k\)-mers counting algorithm
- Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector
- GAGE
- Gerbil
- Velvet
- KAnalyze
- Turtle
- SDSL
- isONclust
- Mash
- Minimap2
- MaSuRCA
- GATB
- Rainbowfish
- VARI
- r-index
- KmerStream
- Kmerlight
- Kraken
- SAKEIMA
- RNA-Skim
- Squeakr
- A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets
- DeepMinimizer: a differentiable framework for optimizing sequence-specific minimizer schemes
- Winnowing
- deGSM
- metaSPAdes
- OGRE
- oblr
- Rainbowfish: a succinct colored de Bruijn graph representation
This page was built for software: KMC
