Skip to main content

Table 4 Running time of PHEP_PMSprune(ons) using different number of processors p for some challenging instances

From: A hybrid method for the exact planted (l, d) motif finding problem and its parallelization

l

d

Time

   

P = 2

P = 3

P =4

P = 5

P = 6

P = 7

P = 8

13

4

24.86 s

12.4 s

8.35 s

6.1 s

4.95 s

4.35 s

3.6 s

3.2 s

15

5

6.34 m

3.19 m

2.13 m

1.61 m

1.28 m

1.07 m

55.2 s

48.5 s

17

6

1.28 h

38.28 m

25.58 m

19.16 m

15.34 m

12.81 m

10.98 m

9.61 m

19

7

14.56 h

7.24 h

4.81 h

3.61 h

2.98 h

2.42 h

2.07 h

1.82 h

21

8

6.68 dy

3.33 dy

2.23 dy

1.67 dy

1.34 dy

1.12 dy

23.18 h

20.42 h