Methods for compressing k-mers set with counters

With this work we want to find an efficient way to compress k-mers sets with counters since they take up a lot of disk space but their use brings several advantages over genomes or sets of genomes. Here some strategies are pro- posed to explore the cdBGs in order to produce smaller files than UST and the counts encoding has been revised. A new application has been presented to implement the above strategies and fix a bug in UST which caused wrong counts ordering. It has been shown that it is possible to improve the com- pression with respect to UST based on the density of the graph. Finally, a small value of k leads to denser graphs and therefore better results.