Skip to main content

Table 3 Comparison of computation speed of FAST_LCS with that of Smith-Waterman algorithm

From: A fast parallel algorithm for finding the longest common sequence of multiple biosequences

   

Time of FAST_LCS (s)

Time of S-W algorithm(s)

Name of Sequences

Length l

Number of pairs

Total time

Average time

Total time

Average time

gi|21466196 ~

0≤l≤50

100

0.49

0.0049

1.09

0.0109

gi|21466195 ~

      

...

      

gi|21466168 ~

      

gi|21466167 ~

      

gi|21466166 ~

      

gi|30250556 ~

      

gi|30230255 ~

      

gi|30230254 ~

      

gi|30229613 ~

      

gi|30229612 ~

      

...

      

gi|30229449 ~

      

gi|30229448 ~

      

gi|30229047 ~

50≤ l≤ 100

100

5.88

0.0588

11.55

0.1155

gi|30229046 ~

      

...

      

gi|30229001 ~

      

gi|30229000 ~

      

gi|30228999 ~

      

gi|30228998 ~

      

...

      

gi|30228849 ~

      

gi|30228848 ~

      

gi|30229447 ~

10≤ l≤ 150

100

29.41

0.2941

65.95

0.6595

gi|30229446 ~

      

...

      

gi|30229249 ~

      

gi|30229248 ~

      

gi|30228846 ~

15≤ l≤ 200

100

94.11

0.9411

172.213

1.7213

gi|30228845 ~

      

...

      

gi|30228648 ~

      

gi|30228647 ~

      

gi|30229247 ~

20≤ l≤ 250

100

230.51

2.3051

425.16

4.2516

gi|30229246 ~

      

...

      

gi|30229049 ~

      

gi|30229048 ~

      
Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us