Provides tools for analysing and decomposing time series data using the Matching Pursuit (MP) algorithm, a greedy signal decomposition technique that represents complex signals as a linear combination of simpler functions (called atoms) selected from a redundant dictionary. Support for the Orthogonal Matching Pursuit (OMP) variant of the classical MP algorithm is also provided. For more details see Mallat and Zhang (1993) <doi:10.1109/78.258082>, Pati et al. (1993) <doi:10.1109/ACSSC.1993.342465>, Elad (2010) <doi:10.1007/978-1-4419-7011-4> and Różański (2024) <doi:10.1145/3674832>.

Computes matching algorithms quickly using Rcpp.
    Implements the Gale-Shapley Algorithm to compute the stable
    matching for two-sided markets, such as the stable marriage
    problem and the college-admissions problem. Implements Irving's
    Algorithm for the stable roommate problem. Implements the top
    trading cycle algorithm for the indivisible goods trading problem.

Selects matched samples of the original treated and
    control groups with similar covariate distributions -- can be
    used to match exactly on covariates, to match on propensity
    scores, or perform a variety of other matching procedures.  The
    package also implements a series of recommendations offered in
    Ho, Imai, King, and Stuart (2007) <DOI:10.1093/pan/mpl013>. (The 
    'gurobi' package, which is not on CRAN, is optional and comes with 
    an installation of the Gurobi Optimizer, available at 
    <https://www.gurobi.com>.)

Core functions as well as diagnostic and calibration tools for combining matching and linear regression for causal inference in observational studies.

Provides flexible dictionary-based
    cleaning that allows users to specify implicit and explicit missing data,
    regular expressions for both data and columns, and global matches, while
    respecting ordering of factors. This package is part of the 'RECON'
    (<https://www.repidemicsconsortium.org/>) toolkit for outbreak analysis.