Detecting repetitions of permutations (patterns) in an array of 1's and 0's

I have an array or X columns, containing only 1's and 0's. Each time I input at the bottom of the array a new row containing some sequence of these two digits. I would like to be able to locate 'patterns' consisting solely of either 1's or 0's in this array. These patterns can have any 'length' from 2 to X, and I would like to see how many times they _repeat_ themselves. An example will explain things much better: Suppose I have the following array, consisting of 6 columns. 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 0 0 0 1 0 0 1 0 0 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 0 1 1 0 0 1 0 0 1 1 0 0 1 0 0 1 1 0 0 1 0 0 Let us say I am interested in patterns of length 3. Starting from the bottom and moving upwards, I notice that I have an ace at column 1 of the bottom row (row 12), then another at column 6 of row 11 and yet another at column 2 of row 10. The same thing happens at rows 9, 8 and 7. Also row 6 possesses an ace at its column 1. But on row 5, column 6 I see a zero, so this pattern 'breaks' there. Therefore I have _two_ 1-repetitions (of length 3) for the permutation (1,6,2), where by '1-repetitions' we will denote repetitions of patterns (permutations) consisting of 1's. Thus a 0-repetition is one consisting solely of zeros. Apparently the 'length' of the pattern equals the number of the members of the permutation. In this example it is 3, but if we had, say, the permutation (5,3,1,2), then we would be talking about a 'pattern' of length 4 etc etc. Now notice the permutation (4,3,5). Again rows 12,11 and 10 contain aces at these corresponding spots, and the same is true for rows 9, 8 and 7. Row 6 gives us hope that we will have yet another repetition with its ace at column 4, our hopes get even better with the ace at column 3 or row five, but unfortunately at row 4, column 5 we see a zero. So we say that the permutation (4,3,5) has also two 1-repetitions of length 3. If row 4, column 5 were an ace, then we would have _three_ 1-repetitions of length 3 for the permutation (4,3,5). Of course after I input rows 13, 14 and 15 maybe we will get lucky and see a new (4,3,5) 1-repetition, for a total of three repetitions now. But in order to have that, what is the first step? The first step is for my next row that I will input (row 13) _to have an ace in column 5_, because otherwise the (4,3,5) pattern 'breaks'. So we say that column 5 of my (future) row is the 'HEIR' , it 'carries the special weight' (call it anyway you like) of two 1-repetitions of a pattern of length 3 (the (4,3,5) permutation), and thanks to this 'inheritance' it hopes to create yet another repetition if everything goes well during the next three inputs of mine. So what will your job be? Please check the attached small Word for details.