Showing 2 of total 2 results (show query)
robinhankin
permutations:The Symmetric Group: Permutations of a Finite Set
Manipulates invertible functions from a finite set to itself. Can transform from word form to cycle form and back. To cite the package in publications please use Hankin (2020) "Introducing the permutations R package", SoftwareX, volume 11 <doi:10.1016/j.softx.2020.100453>.
Maintained by Robin K. S. Hankin. Last updated 2 months ago.
6 stars 8.23 score 49 scripts 2 dependents
cran
PerMallows:Permutations and Mallows Distributions
Includes functions to work with the Mallows and Generalized Mallows Models. The considered distances are Kendall's-tau, Cayley, Hamming and Ulam and it includes functions for making inference, sampling and learning such distributions, some of which are novel in the literature. As a by-product, PerMallows also includes operations for permutations, paying special attention to those related with the Kendall's-tau, Cayley, Ulam and Hamming distances. It is also possible to generate random permutations at a given distance, or with a given number of inversions, or cycles, or fixed points or even with a given length on LIS (longest increasing subsequence).
Maintained by Ekhine Irurozki. Last updated 2 months ago.
1 stars 1.00 score