2013
DOI: 10.1093/bioinformatics/btt020
|View full text |Cite
|
Sign up to set email alerts
|

DSK: k-mer counting with very low memory usage

Abstract: http://minia.genouest.org/dsk

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
240
0
2

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 282 publications
(249 citation statements)
references
References 2 publications
0
240
0
2
Order By: Relevance
“…First, starting from the full read set of Vc3 (40.3 million read pairs), reads were filtered according to their k-mer coverage to obtain only the reads originating from the targeted genome and thus avoid simultaneously assembling the whole nuclear pea aphid genome. Given that the targeted genome had an average read depth in Vc3 of around 600 × , only reads for which 68% of the length was covered by 31-mers present at least 100 times in the data set were retained, using readFilter (P Peterlongo et al, unpublished) a custom software based on k-mer counts performed by the DSK software (Rizk et al, 2013). Reads that could be mapped to the B. aphidicola or mitochondrial genomes were removed as their coverage levels would otherwise lead them to be retained in this read set.…”
Section: De Novo Assembly and Characterization Of An Aphid Symbiont Gmentioning
confidence: 99%
“…First, starting from the full read set of Vc3 (40.3 million read pairs), reads were filtered according to their k-mer coverage to obtain only the reads originating from the targeted genome and thus avoid simultaneously assembling the whole nuclear pea aphid genome. Given that the targeted genome had an average read depth in Vc3 of around 600 × , only reads for which 68% of the length was covered by 31-mers present at least 100 times in the data set were retained, using readFilter (P Peterlongo et al, unpublished) a custom software based on k-mer counts performed by the DSK software (Rizk et al, 2013). Reads that could be mapped to the B. aphidicola or mitochondrial genomes were removed as their coverage levels would otherwise lead them to be retained in this read set.…”
Section: De Novo Assembly and Characterization Of An Aphid Symbiont Gmentioning
confidence: 99%
“…Разработано достаточное количество программных средств, предназначенных для подсчета числа k-меров в последовательностях: Jellyfish [8], BFCounter [9], DSK [10] и другие. Поскольку BFCounter не позволяет отслеживать k-меры, встречающиеся в единственном экземпляре, а DSK не смог корректно завершить свою работу на ряде входных данных, было принято решение использовать программу Jellyfish для подсчета числа встречаемости k-меров.…”
Section: подсчет числа уникальных K-меровunclassified
“…DSK [10] uses this method to make kmers partitioning in disk. To make the kmers disk partitioning is necessary to calculate the number of kmers, the number of iterations (ni) to cycle through the kmers and the number of partitions (np) to be created in disk.…”
Section: Kmers Distribution Through a Hash Functionmentioning
confidence: 99%
“…function with the use of DSK [10] for the kmer counting stage and the minimizers method through BCALM [12] for node simplification in the De Bruijn graph. Once the nodes are simplified and contigs generated EPGA2 joins the contigs in parallel [17].…”
Section: International Journal Of Bioscience Biochemistry and Bioinfmentioning
confidence: 99%