Skip to main content

Table 6 Wall clock time (s) and maximum RAM usage (GB) for algorithms on assigning simulated long reads (LR)

From: Mora: abundance aware metagenomic read re-assignment for disentangling similar strains

Algorithm

LR to REF-1

LR to REF-2

Time (s)

RAM (GB)

Time (s)

RAM (GB)

Mora

56.32

0.77

98.72

2.04

AugPatho2

341.93

21.52

429.23

22.522

Minimap2

1074.89

11.228

8696.29

20.048

Kraken2

193.08

2.58

326.09

25.01

Clark*

56.68

40.80

51.31

36.65

  1. Mora used significantly fewer resources than AugPatho2 and was substantially faster. Time and RAM cannot be directly compared between the Mora/AugPatho2 and Kraken/Clark as Mora and AugPatho2 requires Minimap2 to give them an output file. Clark has an asterisk to signify that had errors in building the REF-2 database, which resulted in less resources used. All algorithms were run with 8 threads on a Google cloud virtual machine instance of type c2-standard-60
Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us