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
On Wed, Jun 30, 2010 at 11:57 AM, Yen Ngo yen.ng...@yahoo.se wrote:
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
On 30-Jun-10 15:48:39, Barry Rowlingson wrote:
On Wed, Jun 30, 2010 at 11:57 AM, Yen Ngo yen.ng...@yahoo.se wrote:
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
3 matches
Mail list logo