Applying the methodology from Manuel et al. to estimate parameters using a matched 
    case control data with a mismeasured exposure variable that is accompanied by 
    instrumental variables (Submitted).

Calculates mean cumulative count (MCC) to estimate the expected cumulative number of recurrent events per person over time in the presence of competing risks and censoring. Implements both the Dong-Yasui equation method and sum of cumulative incidence method described in Dong, et al. (2015) <doi:10.1093/aje/kwu289>. Supports inverse probability weighting for causal inference as outlined in Gaber, et al. (2023) <doi:10.1093/aje/kwad031>. Provides S3 methods for printing, summarizing, plotting, and extracting results. Handles grouped analyses and integrates with 'ggplot2' <https://ggplot2.tidyverse.org/> for visualization.

The Matthews correlation coefficient (MCC) score is calculated (Matthews BW  (1975) <DOI:10.1016/0005-2795(75)90109-9>).

Maximum likelihood estimation for generalized linear mixed models via Monte Carlo EM.
    For a description of the algorithm see Brian S. Caffo, Wolfgang Jank and Galin L. Jones (2005)
	<DOI:10.1111/j.1467-9868.2005.00499.x>.

Fits the Multivariate Cluster Elastic Net (MCEN) presented in Price & Sherwood (2018) <arXiv:1707.03530>. The MCEN model simultaneously estimates regression coefficients and a clustering of the responses for a multivariate response model. Currently accommodates the Gaussian and binomial likelihood.

Machine coded genetic algorithm (MCGA) is a fast tool for
    real-valued optimization problems. It uses the byte
    representation of variables rather than real-values. It
    performs the classical crossover operations (uniform) on these
    byte representations. Mutation operator is also similar to
    classical mutation operator, which is to say, it changes a
    randomly selected byte value of a chromosome by +1 or -1 with
    probability 1/2. In MCGAs there is no need for
    encoding-decoding process and the classical operators are
    directly applicable on real-values. It is fast and can handle a
    wide range of a search space with high precision. Using a
    256-unary alphabet is the main disadvantage of this algorithm
    but a moderate size population is convenient for many problems.
    Package also includes multi_mcga function for multi objective
    optimization problems. This function sorts the chromosomes
    using their ranks calculated from the non-dominated sorting
    algorithm.