Skip to main content

Table 2 Algorithms’ running times and memory usage on different datasets collections

From: gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections

Collection

gsufsort

gsufsort-light

mkESA

Time

RAM

Bytes/N

Time

RAM

Bytes/N

Time

RAM

Bytes/N

shortreads

4:25:52

336.00

21.00

5:30:54

272.00

17.00

4:51:48

274.73

17.17

reads

5:00:27

336.00

21.00

5:10:04

272.00

17.00

5:44:58

280.68

17.54

pacbio

4:19:37

336.04

21.00

4:54:21

272.03

17.00

4:26:39

272.58

17.03

pacbio.1000

4:28:22

336.00

21.00

5:20:39

272.00

17.00

4:44:50

272.32

17.02

uniprot

5:11:33

336.90

21.00

5:25:37

272.73

17.00

9:58:03

294.86

18.38

gutenberg

4:17:52

334.40

21.00

4:53:05

269.90

17.00

random.dna

4:23:56

331.08

21.00

5:41:45

268.02

17.00

4:28:43

268.33

17.02

random.protein

5:20:06

331.08

21.00

5:47:38

268.02

17.00

4:37:16

268.33

17.02

  1. Columns RAM and bytes/N show the peak memory in GB and the bytes per input symbol ratio. Each symbol of \(T[0,N-1]\) uses 1 byte. Results for gutenberg are reported for gsufsort and gsufsort-light only, as mkESA is restricted to DNA and amino-acid alphabets. The best results are indicated in italics