FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search

Table 5

Performance comparison between FAST-LCS and FACC on the 20 amino acid sequences (|Σ|=20) with lengths from 25 to 320.

|𝑆𝑖|	FAST-LCS algorithm				FACC algorithm
	Time (ms)	|MLCS|	𝑁MLCS	Precision	T (ms)	|MLCS|	𝑁MLCS	Precision	TPR
25	96	3	11	1.00	104	3	11	1.00	0.92
50	171	5	2	1.00	158	5	2	1.00	1.08
75	682	8	26	1.00	373	8	26	1.00	1.83
100	1177	14	1	1.00	601	14	1	1.00	1.96
120	2489	19	8	1.00	1210	19	8	1.00	2.06
140	4161	20	109	0.92	2006	20	119	1.00	2.07
160	14460	28	190	0.98	7192	28	194	1.00	2.01
180	32245	32	62	0.95	15807	32	65	1.00	2.04
200	69332	36	22	1.00	33803	36	22	1.00	2.05
220	140677	38	534	0.99	67889	38	539	1.00	2.07
240	269059	42	353	1.00	127409	42	353	1.00	2.11
260	497177	47	637	0.98	217605	47	650	1.00	2.28
280	1116905	49	8689	1.00	478707	49	8728	1.00	2.33
300	1617748	53	454	0.98	658212	53	462	1.00	2.46
320	2951500	60	201	0.96	1129275	60	210	1.00	2.61

Note: TPR indicates the ratio of the running time of FAST-LCS to that of FACC in Table 5.