Recursive partitioning methods to build
        classification trees for ordinal responses within the CART
        framework. Trees are grown using the Generalized Gini
        impurity function, where the misclassification costs are given
        by the absolute or squared differences in scores assigned to
        the categories of the response. Pruning is based on the total
        misclassification rate or on the total misclassification cost.

This project is a tool for words edit similarity joins (a.k.a. all-pairs similarity search) under small (< 3) edit distance constraints. 
  It works for Levenshtein/Hamming distances and words from any alphabet. 
  The software was originally developed for joining amino-acid/nucleotide sequences from Adaptive Immune Repertoires, 
  where the number of words is relatively large (10^5-10^6) and the average length of words is relatively small (10-100).

Fit and simulate any kind of
    physiologically-based kinetic ('PBK') models whatever the number of compartments.
    Moreover, it allows to account for any link between pairs of compartments, as
    well as any link of each of the compartments with the external medium. Such
    generic PBK models have today applications in pharmacology (PBPK models) to
    describe drug effects, in toxicology and ecotoxicology (PBTK models) to describe
    chemical substance effects. In case of exposure to a parent compound (drug or
    chemical) the 'rPBK' package allows to consider metabolites, whatever their number
    and their phase (I, II, ...). Last but not least, package 'rPBK' can also be used for
    dynamic flux balance analysis (dFBA) to deal with metabolic networks. See also
    Charles et al. (2022) <doi:10.1101/2022.04.29.490045>.

Computes the ridge partial correlation
    coefficients in a high or ultra-high dimensional linear regression
    problem. An extended Bayesian information criterion is also
    implemented for variable selection. Users provide the matrix
    of covariates as a usual dense matrix or a sparse matrix
    stored in a compressed sparse column format. Detail of the method
    is given in the manual.