Cited in
(17)- \textit{De novo} clustering of long-read transcriptome data using a greedy, quality-value based algorithm
- Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences
- Approximate word matches between two random sequences
- Extraction of high quality \(k\)-words for alignment-free sequence comparison
- An example of a stationary, triplewise independent triangular array for which the CLT fails
- Cogent
- Rainbow
- Corset
- DNACLUST
- EasyCluster2
- isONclust
- Grouper
- LSC
- MeShClust
- parasail
- SlideSort
- Starcode
This page was built for software: d2_cluster
