I need to perform a search for all strings of lengths, say, L = [8 ... 13] characters. There are only 4 characters which can be used to make up the strings, say, [a b c d].
In other words, for a size L I need to count the matches for each of the permutations (obviously with repetition). I.e. I need to count the matches for each of the 4^L permutations.
I know there is something like Algorithm::Permute out there but I don't think it solves my problem.
Thanks for any hints.
HadassaIn reply to Permutation with repetitions by umeboshi
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |