Skip to main content

Table 1 The results of the Deposition process and the Reduction process.

From: Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm

Sequences Length of CS (averaged over 10 instances)
k n LB |CSD| R' D |CSR| R' R
100 100 158.0 267.8 (7.1) 1.69 264.5 (6.8) 1.67
500 100 160.6 274.9 (7.3) 1.71 273.0 (7.1) 1.70
1000 100 161.3 277.1 (6.0) 1.72 275.6 (6.2) 1.71
5000 100 162.9 281.6 (4.0) 1.73 279.9 (4.2) 1.72
100 1000 1441.8 2495.4 (50.6) 1.73 2480.2 (55.5) 1.72
500 1000 1457.6 2543.9 (48.6) 1.75 2527.2 (52.1) 1.73
1000 1000 1472.3 2557.5 (45.1) 1.74 2540.0 (47.4) 1.73
5000 1000 1481.6 2566.6 (35.1) 1.73 2548.3 (39.7) 1.72
  1. Each row of the table represents 10 randomly generated instances. For each row, we list the average value for LB (the lower bound), |CS D |, and |CS R | (the length of the common supersequences after Depostion and Reduction), their standard deviations (in parenthesis), and the estimated performance ratios R' D and R' R (|CS D |/LB and |CS R |/LB)