Improved Analysis of High-Throughput Sequencing Data Using Small Universal k-Mer Hitting Sets
Reference26 articles.
1. Almutairy M, Torng E (2018) Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches. PLoS One 13(2):e0189960
2. Anders S, Pyl PT, Huber W (2015) HTSeq—a Python framework to work with high-throughput sequencing data. Bioinformatics 31(2):166–169
3. Baker DN, Langmead B (2019) Dashing: fast and accurate genomic distances with HyperLogLog. Genome Biol 20(1):265
4. Berlin K, Koren S, Chin CS, Drake JP, Landolin JM, Phillippy AM (2015) Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nat Biotechnol 33(6):623
5. Chikhi R, Limasset A, Medvedev P (2016) Compacting de Bruijn graphs from sequencing data quickly and in low memory. Bioinformatics 32(12):i201–i208