< Back to Article

Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing

Table 1

Length of longest sequence avoiding an unavoidable set for different values of k.

For each value k, a minimum decycling set was removed from a complete de Bruijn graph, and the length Lmax of the longest sequence, represented as a longest path, was calculated.

Table 1