Table 1 Experiment 2: Obtained speedup of BIDsearch over ONLsearch for different loop length l ∈ {3,..., 20} and number of non-ambiguous characters in the loop region q ∈ {0, ... , 4}

78.10

48.64

35.42

23.55

16.35

11.01

7.31

4.89

3.48

329.81

180.45

105.67

57.41

33.75

19.20

11.30

7.14

4.81

749.94

418.65

227.45

121.80

67.81

36.99

21.44

12.73

8.41

2,345.17

1,169.53

653.31

353.49

188.34

103.34

56.59

33.08

20.79

11,045.75

3,638.14

2,144.8

1,132.53

610.63

338.77

184.56

106.11

64.93

12

13

14

15

16

17

18

19

20

2.67

2.15

1.79

1.51

1.37

1.20

1.13

1.07

1.00

3.58

3.13

2.28

1.89

1.68

1.46

1.35

1.27

1.12

5.96

4.88

3.64

2.94

2.57

2.19

2.02

1.82

1.63

14.27

11.88

8.25

6.50

5.53

4.74

4.19

3.76

3.34

43.09

35.23

25.74

19.52

15.91

13.25

11.75

10.32

9.28