Diagonal similarity matrix is a special case and needs its own class. It does not have an actual matrix, instead using a test "if (col == row)" and returning the diagonal value if true, and the off diagonal value if false.

Representation of a matrix that contains similarity scores for every pair of symbols in an alphabet. BLOSUM and PAM are well-known examples.

List of available standard similarity matrices.