Skip to main content

Table 5 The performance of the CMDIMUS algorithm when using a single processing core.

From: A parallel and incremental algorithm for efficient unique signature discovery on DNA databases

(A) The results on D13.

( l' , d' )

(28,2)

(26,2)

(24,2)

(30,4)

(28,4)

(26,4)

(24,4)

overall

IMUS

00:23:56

00:30:24

00:43:35

00:50:57

01:10:14

01:57:30

03:57:25

09:34:01

CMDIMUS

00:03:06

00:04:54

00:08:33

00:20:22

00:27:09

00:44:03

01:21:22

03:09:29

saving(%)

87.03

83.84

80.35

60.01

61.33

62.50

65.73

66.99

(B) The results on D 21 .

( l' , d' )

(28,2)

(26,2)

(24,2)

(30,4)

(28,4)

(26,4)

(24,4)

overall

IMUS

00:06:25

00:08:22

00:11:48

00:19:17

00:25:08

00:40:13

01:16:54

03:08:07

CMDIMUS

00:01:27

00:02:13

00:03:48

00:11:08

00:13:38

00:20:17

00:37:28

01:29:59

saving(%)

77.43

73.61

67.81

42.24

45.80

49.56

51.28

52.17

  1. The table presents the processing time that for the IMUS algorithm, and the time savings delivered by the CMDIMUS algorithm. The time format used in the table is HH:MM:SS.