I wanted to compare the alphabets with 4 columns for every 4 rows.
For example,
A = [aabc;dbba;a]
B = [aabc;baba;c]
C = [aabc;dbba;b]
D = [bcac;bcbc;a]
ABCD are the columns. If we look at the table above shows first four rows, "aabc" repeated in 3 columns. So, out of 4, 3 gets correct matching.it is 3/4. for the second cycle, we can see "dbba" repeated so it 2/4.This is for 4 rows vs 4 rows, now the same matching method for taking one line down, two line down and three line down comparing with other string. Means, the rows will be constant and just the alphabets changing. The formula can be in the new column say E and results will be there.
For example,
A = [aabc;dbba;a]
B = [aabc;baba;c]
C = [aabc;dbba;b]
D = [bcac;bcbc;a]
ABCD are the columns. If we look at the table above shows first four rows, "aabc" repeated in 3 columns. So, out of 4, 3 gets correct matching.it is 3/4. for the second cycle, we can see "dbba" repeated so it 2/4.This is for 4 rows vs 4 rows, now the same matching method for taking one line down, two line down and three line down comparing with other string. Means, the rows will be constant and just the alphabets changing. The formula can be in the new column say E and results will be there.
