Dear list,
I have a vector of letter strings as follow:
> LETTERS[c(1:7,9,15,18:25)]
[1] "A" "B" "C" "D" "E" "F" "G" "I" "O" "R" "S" "T" "U" "V" "W" "X" "Y"
I need to find sequences of length 11, which are made from all possible
permutations with repetition (not the unique ones) of the letter string A with
the other strings, for example AAAAAAAAAAB, AAAAAAAAAABC, AAAAAAAAACB,
AABAAAAAAAB. A can be repeated 1-11 times in the sequence.
Is there a way to do this in R?
Any help would be much appreciated.
Best regards,
Yen
[[alternative HTML version deleted]]
______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
