Hi! I have 2 matrices of numbers m1 and m2 with the same number of columns and rows. I would like to compute m2', the permutation of the rows of m2 such that the distance (e.g., sum(m1-m2') or sum((m1-m2')^2)) is minimized. Do you know of any function/algorithm to obtain such a permutation? Best regards, Carlos
______________________________________________ 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.
