Skip to main content

Table 4 The Lower(R)/run time(s) generated by different change in t

From: A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problems

Length of sequences

R

Lower(R)

10

20

50

100

150

90

8

8/0.06

8/1.63

8/2.73

8/4.13

8/5.79

95

9

8/1.28

8/1.88

9/2.60

9/4.88

9/6.68

100

10

10/1.15

10/2.28

10/4.99

10/8.77

10/10.81

105

11

11/0.77

11/2.50

11/3.47

11/10.60

11/9.37

110

11

10/1.68

11/2.74

11/4.35

11/10.19

11/13.03

115

12

10/1.55

11/2.85

11/6.75

12/11.29

12/15.77

120

13

12/1.07

12/2.53

12/4.21

13/6.38

13/10.21