A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i> -mers 论文
2011Bioinformatics引用 5008顶会
Genomics and Phylogenetic StudiesGenome Rearrangement AlgorithmsAlgorithms and Data Compression
A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i> -mers · 相关文章
暂无数据