If you aren't interested in the permutations themselves, just the number of them (if I read you right)....
> The only way I could think up to know exactly what > fraction of the optimum (2x 5%: remember the diploidi)) a set of > combined filters can present is by expanding these filters into a set > of all possible strings that they can present, and counting this set. > (count (expand (first myset)))) Then there is no real need to generate them at all: user=> (reduce * (map count [[1 2 3] [3 4]])) 6 Regards, Tim. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
