For a length of 64, at usage_generateExhaustivePermutation.m
% Caveat: may run out of memory when >= 10;
% note as well that lengthOf1PatternSeq has to be >= length(bases)
lengthOf1PatternSeq = 64;
bases = 'ABCD';
Please note the caveat of memory issue, unless your machine has large memory capacity. However, you may wish to run by parts, ie. using another sample usage (computePermutationSeqForSpecificIndex.m), the usage is illustrated by: usage_computePermutationSeqForSpecificIndex.m
You may also convert it to C or java. It can be faster, however, in C, please note on the use of 'malloc' (memory allocation).
I have 4 letters... A,B,C,D. I need all possible combos of this, 64. Can you explain how I would install and run this code? I attempted to, and got an error below.
??? Input argument "bases" is undefined.
Error in ==> generateExhaustivePermutation at 9
numberOfUniqueBases = length(bases);"