[R] enumerating non-overlapping pairs of elements from a vector

Hi All, I'm trying to come up with a clear and concise (and fast?) solution to the following problem. I would like to take a vector 'v' and enumerate all of the ways in which it can be broken into n sets of length 2 (if the length of the vector is odd, and an additional set of length 1). An

[R] recategorizing a vector into discrete states

, 8.1, 3.3, 4.5) b - c(0, 2, 4, 6, 8) c - c(0, 8, 0, 2, 4, 4, 6, 8, 2, 4) Any suggestions would be greatly appreciated. cheers, Allan Strand __ R-help@stat.math.ethz.ch mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read

[R] rmetasim: a population genetic simulation environment

/rmetasim_0.0.3_R_powerpc-apple-darwin6.8.tar.gz Binary distribution for Windows: http://linum.cofc.edu:/filedrop/rmetasim_0.0.3.zip cheers, a. -- Allan Strand, Biologyhttp://linum.cofc.edu College of Charleston Ph. (843) 953-9189 Charleston, SC 29424 Fax (843) 953-9199

[R] vectorized leave one out analyses

and likely fast, though there may be memory issues. I'm sure that this is a general problem that somebody has solved in an elegant fashion. I'm just looking for the solution. -- Allan Strand, Biologyhttp://linum.cofc.edu College of Charleston Ph. (843) 953-9189 Charleston, SC 29424 Fax