An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

Table 1

Examples of compressed alphabets.

Alphabet (𝑁)	Classes
SE-B (14)	A, C, D, EQ, FY, G, H, IV, KR, LM, N, P, ST, W
SE-B (10)	AST, C, DN, EQ, FY, G, HW, ILMV, KR, P
SE-V (10)	AST, C, DEN, FY, G, H, ILMV, KQR, P, W
Li-A (10)	AC, DE, FWY, G, HN, IV, KQR, LM, P, ST
Li-B (10)	AST, C, DEQ, FWY, G, HN, IV, KR, LM, P
Solis-D (10)	AM, C, DNS, EKQR, F, GP, HT, IV, LY, W
Solis-G (10)	AEFIKLMQRVW, C, D, G, H, N, P, S, T, Y
Murphy (10)	A, C, DENQ, FWY, G, H, ILMV, KR, P, ST
SE-B (8)	AST, C, DHN, EKQR, FWY, G, ILMV, P
SE-B (6)	AST, CP, DEHKNQR, FWY, G, ILMV
Dayhoff (6)	AGPST, C, DENQ, FWY, HKR, ILMV