Skip to main content

Table 3 The average results for benchmark BL, length fixed to 100

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

Number of sequences

\(|\Sigma |\)

A*

Top-MLCS

mini-MLCS

\({\overline{R}}\)

\({\overline{t}}\)

\(\#\)opt

\({\overline{R}}\)

\({\overline{t}}\)

\(\#\)opt

\({\overline{R}}\)

\({\overline{t}}\)

\(\#\)opt

10

4

20.5

428.33

6

0.0

–

0

20.5

393.76

6

12

12.7

1.73

10

12.7

5.2

10

12.7

0.78

10

20

7.9

0.08

10

7.9

0.28

10

7.9

0.07

10

50

4

0.0

–

0

0.0

–

0

20.1

374.20

7

12

6.9

0.17

10

6.9

0.46

10

6.9

0.11

10

20

3.0

0.06

10

3.0

0.08

10

3.0

0.05

10

100

4

0.0

–

0

0.0

–

0

19.3

311.36

6

12

5.2

0.08

10

5.2

0.23

10

5.2

0.05

10

20

2.1

0.07

10

2.1

0.08

10

2.1

0.04

10

150

4

0.0

–

0

0.0

–

0

18.8

280.54

9

12

4.7

0.07

10

4.7

0.16

10

4.7

0.05

10

20

1.9

0.08

10

1.9

0.08

10

1.9

0.03

10

200

4

0.0

–

0

0.0

–

0

18.0

180.24

8

12

4.1

0.07

10

4.1

0.18

10

4.1

0.06

10

20

1.1

0.06

10

1.1

0.11

10

1.1

0.01

10

  1. The bold values represent the shortest average running time of all the algorithms in the table on the dataset