Skip to main content

Table 1 The run time (s)/memory (GB) consumed by the compared algorithms on DNA sequences with length fixed to 120

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

Number of sequences

R

DNA(\(|\Sigma | = 4\))

mini-MLCS

Top-MLCS

Quick-DP

Fast-MLCS

10,000

15

\({\textbf {777.1/8.1}}\)

1245.7/31.8

\(+\)

\(+\)

15,000

14

\({\textbf {966.3/14.7}}\)

1499.2/17.2

\(+\)

\(+\)

20,000

13

\({\textbf {1151.1/12.3}}\)

1362.8/17.6

\(+\)

\(+\)

25,000

13

\({\textbf {1162.7/11.1}}\)

1225.1/35.8

\(+\)

\(+\)

30,000

11

\({\textbf {173.9/1.8}}\)

226.1/2.9

515.5/5.1

\(+\)

35,000

11

\({\textbf {146.3/1.9}}\)

403.0/3.9

590.6/5.1

\(+\)

40,000

11

\({\textbf {234.4/1.8}}\)

256.1/3.1

432.6/5.5

\(+\)

45,000

11

\({\textbf {174.9/2.1}}\)

393.7/3.4

480.2/5.4

\(+\)

50,000

11

\({\textbf {195.9/2.1}}\)

298.8/3.6

448.1/6.6

\(+\)

  1. The bold values represent the minimum running time and minimum memory of all the algorithms in the table on the dataset