问题
I have a vector of elements named markers of the form:
markers <- LETTERS[1:5]
Each element in markers is of Boolean type with two possible conditions + and -. I would like a fast an efficient way to obtain all possible combinations, so that the two conditions are considered (a marker with cannot be paired with itself even if the condition is different).
The result would ideally be just a character vector or a list, where its elements are the marker combinations separated by /.
The elements for this example with five letters should be:
A-/B-/C-/D-/E-
A-/B+/C-/D-/E-
A-/B-/C+/D-/E-
A-/B-/C-/D+/E-
A-/B-/C-/D-/E+
A-/B+/C+/D-/E-
A-/B+/C-/D+/E-
A-/B+/C-/D-/E+
A-/B+/C+/D+/E-
A-/B+/C+/D-/E+
A-/B+/C+/D+/E+
A+/B-/C-/D-/E-
A+/B+/C-/D-/E-
A+/B-/C+/D-/E-
A+/B-/C-/D+/E-
A+/B-/C-/D-/E+
A+/B+/C+/D-/E-
A+/B+/C-/D+/E-
A+/B+/C-/D-/E+
A+/B+/C+/D+/E-
A+/B+/C+/D-/E+
A+/B+/C+/D+/E+
...
Not sure if I'm missing any combination, but you get the idea... I've been trying with expand.grid and combn but I don't seem to get it right. Any help appreciated!
Thanks!
回答1:
markers <- LETTERS[1:5]
test <- expand.grid(lapply(seq(markers), function(x) c("+","-")),stringsAsFactors=FALSE)
> test
Var1 Var2 Var3 Var4 Var5
1 + + + + +
2 - + + + +
3 + - + + +
4 - - + + +
....
apply(test,1,function(x){paste0(markers,x,collapse = "/")})
[1] "A+/B+/C+/D+/E+" "A-/B+/C+/D+/E+" "A+/B-/C+/D+/E+" "A-/B-/C+/D+/E+" "A+/B+/C-/D+/E+" "A-/B+/C-/D+/E+" "A+/B-/C-/D+/E+"
[8] "A-/B-/C-/D+/E+" "A+/B+/C+/D-/E+" "A-/B+/C+/D-/E+" "A+/B-/C+/D-/E+" "A-/B-/C+/D-/E+" "A+/B+/C-/D-/E+" "A-/B+/C-/D-/E+"
[15] "A+/B-/C-/D-/E+" "A-/B-/C-/D-/E+" "A+/B+/C+/D+/E-" "A-/B+/C+/D+/E-" "A+/B-/C+/D+/E-" "A-/B-/C+/D+/E-" "A+/B+/C-/D+/E-"
[22] "A-/B+/C-/D+/E-" "A+/B-/C-/D+/E-" "A-/B-/C-/D+/E-" "A+/B+/C+/D-/E-" "A-/B+/C+/D-/E-" "A+/B-/C+/D-/E-" "A-/B-/C+/D-/E-"
[29] "A+/B+/C-/D-/E-" "A-/B+/C-/D-/E-" "A+/B-/C-/D-/E-" "A-/B-/C-/D-/E-"
回答2:
To add to the excellent base R answer by @denis, here is a one-liner using RcppAlgos*. It should be a bit more efficient than the proposed solution:
n <- 5
RcppAlgos::permuteGeneral(c("+", "-"), n, repetition = TRUE, FUN = function(x) {
paste0(LETTERS[1:n], x, collapse = "/")
})
[[1]]
[1] "A+/B+/C+/D+/E+"
[[2]]
[1] "A+/B+/C+/D+/E-"
[[3]]
[1] "A+/B+/C+/D-/E+"
.
.
.
[[30]]
[1] "A-/B-/C-/D+/E-"
[[31]]
[1] "A-/B-/C-/D-/E+"
[[32]]
[1] "A-/B-/C-/D-/E-"
It should be noted that the majority of computation is in dealing with manipulating character vectors. Thus, it will be difficult to achieve any sort of huge efficiency gain no matter what tool you use.
* I am the author
来源：https://stackoverflow.com/questions/64040588/r-all-possible-combinations-from-a-vector-of-elements-with-2-possible-condition