A set of functions to build simple 
        GUI controls for R functions.  These are built on the 'tcltk' package. 
        Uses could include changing a parameter on a graph by animating it 
        with a slider or a "doublebutton", up to more sophisticated control 
        panels.
        Some functions for specific graphical tasks, referred to as 'cartoons',
        are provided.

Download and merge labeled single-cell RNA-seq data from the PanglaoDB <https://panglaodb.se/> into a Seurat object.

Provides a simple and efficient way to read data from Paradox 
    database files (.db) directly into R as modern 'tibble' data frames. 
    It uses the underlying 'pxlib' C library, to handle the low-level file format 
    details and provides a clean, user-friendly R interface.

Recursive partitioning for classification, 
  regression and survival trees.  An implementation of most of the 
  functionality of the 1984 book by Breiman, Friedman, Olshen and Stone.

Recursive partitioning for least absolute deviation regression trees. Another algorithm from the 1984 book by 
             Breiman, Friedman, Olshen and Stone in addition to the 'rpart' package (Breiman, Friedman, Olshen, Stone (1984, ISBN:9780412048418).

Plot 'rpart' models. Extends plot.rpart() and text.rpart()
             in the 'rpart' package.

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).