Skip to main content

Table 2 An example of using the PEL heuristic to build an entry list.

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

(A) The original entry list.

ID

A

B

C

D

E

F

G

H

I

J

K

 

|*|

33

26

49

5

143

9

72

29

11

55

22

 

(B) After first iteration, w = 4.

ID

J

G

C

E

D

F

B

H

I

A

K

 

|*|

55

72

49

143

5

9

26

29

11

33

22

 

(C) After second iteration, w = 1.

ID

E

G

C

J

D

F

B

H

I

A

K

 

|*|

143

72

49

55

5

9

26

29

11

33

22

 

(D) The final entry list.

ID

E 1

E 2

G

C

J

D

F

B

H

I

A

K

|*|

71

72

72

49

55

5

9

26

29

11

33

22

  1. Let |*| denote the number of candidate patterns in an entry. Part (A) presents the original entry list. Entries A and J, B and G as well as D and E are exchanged. Part (B) presents the new entry list. Entries J and E are exchanged in the next iteration, yielding Part (C). Assume a two-processor computer is used. Entry E is divided into two partitions E1 and E2, and E1 and E2 are added to the list. The new list is as shown in Part (D).