Skip to main content

Table 2 The run time (s)/memory (GB) consumed by the compared algorithms on DNA sequences with number fixed to 20,000

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

Length of sequences

R

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

mini-MLCS

Top-MLCS

Quick-DP

Fast-MLCS

90

8

3.7/0.2

4.8/0.1

\({\textbf {2.8/0.1}}\)

38.84/0.8

95

9

14.1/0.3

25.6/0.4

\({\textbf {11.4/0.9}}\)

466.5/0.9

100

10

\({\textbf {29.4/0.7}}\)

39.5/1.1

76.9/2.6

4531.1/1.7

105

11

\({\textbf {74.6/1.6}}\)

91.9/2.1

339.6/3.6

\(+\)

110

11

\({\textbf {102.9/1.6}}\)

130.2/2.5

437.3/5.3

\(+\)

115

12

\({\textbf {190.2/2.9}}\)

256.0/3.6

809.9/6.6

\(+\)

120

13

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

1362.8/17.6

\(+\)

\(+\)