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

Table 2

Comparison between the use of the alphabet A and the compressed alphabet SE-V (10).

Seq1: sAaNiLvGEnlvcKvaDFGLARl
Seq2: aArNiLvGEnyicKvaDFGLARl
Seq3: aA∗rN∗vL∗iG∗E∗dnvaK∗icD∗F∗G∗L∗A∗R∗v
Using the default amino acids alphabet
Seq1: AAaNILIGENlIcKIaDFGLARI
Seq2: AArNILIGENyIcKIaDFGLARI
Seq3: A∗A∗rN∗I∗L∗I∗G∗E∗N∗nI∗aK∗I∗cD∗F∗G∗L∗A∗R∗I∗
Using the compressed alphabet SE-V (10)
(each class member is represented by the first letter in alphabetical order)