Skip to main content

Table 8 Effect of each heap strategies on time

From: Generalized enhanced suffix array construction in external memory

Dataset

\(\emptyset \)

{a}

{b}

{c}

{a, b}

{a, c}

{b, c}

{a, b, c}

Time in \(\upmu \)s/byte

 dna.8GB

10.08

8.13

8.52

6.79

6.43

5.60

5.68

4.91

 protein.8GB

3.88

2.74

3.49

2.76

2.26

2.15

2.58

2.04

 gutenberg.8GB

3.18

1.48

2.96

2.47

1.35

1.55

2.33

1.46

 enwiki.8GB

3.28

1.87

3.04

2.42

1.73

1.82

2.25

1.54

Efficiency

 dna.8GB

0.98

0.97

0.98

0.98

0.95

0.95

0.97

0.93

 protein.8GB

0.95

0.88

0.96

0.94

0.89

0.87

0.92

0.83

 gutenberg.8GB

0.95

0.83

0.95

0.93

0.77

0.77

0.92

0.75

 enwiki.8GB

0.96

0.86

0.95

0.91

0.78

0.76

0.92

0.82

  1. All possible combinations of (a) prefix assembly, (b) \(\mathsf {LCP}\) comparison and (c) suffix induction are plotted for the datasets. \(\emptyset \) is the case when none of them is used, and \(\{b, c\}\) and \(\{a, b, c\}\) are the same presented in columns \(p=0\) and \(p=10\) of Table 7