A terribly confusing question. (Even if I ignore the fact that your subject says 10 elements, but the question text says 26 elements each.) Do you merely want to pass in blocks of 26 elements, one block at a time into the function?
If so, then just use a loop. People get too hung up on needing to have everything neatly vectorized, so it works in one line as if by magic. At the same time, that one line becomes impossible to read, debug and maintain, and runs no more quickly than a simple loop. And this would not be even a big loop.
If you really insist on something that makes even the above loop more easy, then first reshape the array, into a 26x26 array.
help reshape
Then, taking each column of that array as a vector, pass it into your function, one at a time. Seriously, there is nothing sophisticated needed here.
Or, do you want some magical piece of code that will generate all possible subsets of 26 elements? If so, then you need to wait for a new computer, possibly waiting many years, since the number of ways you can extract subsets of size 26 from 676 elements is literally too large to even comprehend.
nchoosek(676,26)
So, roughly the square of Avogadro's number. HUGE. IMMENSE.
Or maybe you are wanting somethign else. Perhaps some code that will choose an optimal subset from that large set. In that case, you need to explain what it is you really need to do.
I'm betting that you just need to use a simple loop.
