Skip to main content

Table 5 The performance of the min-cover algorithm (Alg. 3) on the datasets Cod, Kestrel, Human, and Bacterial, for which we report the number of distinct \(k\)-mers (n) and the number of strings (m) after running UST [30] on the collections

From: On weighted k-mer dictionaries

Dataset

n

m

r

Alg. 3 (sec)

Alg. 3 (ns/node)

Cod

502,465,200

2,406,681

4,183,202

0.14

57

Kestrel

1,150,399,205

682,444

1,140,743

0.03

49

Human

2,505,445,761

13,013,742

22,680,047

0.76

59

Bacterial

5,350,807,438

26,448,286

56,662,230

1.64

62

  1. The performance of the algorithm is expressed as the number of runs (r) after the run-reduction optimization and running time (in total seconds and average ns/node)