Efficient algorithms for fitting the regularization path of linear
  regression, GLM, and Cox regression models with grouped penalties.  This
  includes group selection methods such as group lasso, group MCP, and
  group SCAD as well as bi-level selection methods such as the group
  exponential lasso, the composite MCP, and the group bridge.  For more
  information, see Breheny and Huang (2009) <doi:10.4310/sii.2009.v2.n3.a10>,
  Huang, Breheny, and Ma (2012) <doi:10.1214/12-sts392>, Breheny and Huang
  (2015) <doi:10.1007/s11222-013-9424-2>, and Breheny (2015)
  <doi:10.1111/biom.12300>, or visit the package homepage
  <https://pbreheny.github.io/grpreg/>.

Provides tools for sparse regression modelling with grouped predictors using the group 
    subset selection penalty. Uses coordinate descent and local search algorithms to rapidly deliver 
    near optimal estimates. The group subset penalty can be combined with a group lasso or ridge 
    penalty for added shrinkage. Linear and logistic regression are supported, as are overlapping 
    groups.

Design of group sequential trials, including non-binding futility analysis
  at multiple time points (Gallo, Mao, and Shih, 2014, <doi:10.1080/10543406.2014.932285>).

Group SLOPE (Group Sorted L1 Penalized Estimation) is
    a penalized linear regression method that is used for adaptive
    selection of groups of significant predictors in a high-dimensional
    linear model. The Group SLOPE method can control the (group) false
    discovery rate at a user-specified level (i.e., control the expected
    proportion of irrelevant among all selected groups of predictors).
    For additional information about the implemented methods please see
    Brzyski, Gossmann, Su, Bogdan (2018) <doi:10.1080/01621459.2017.1411269>.

Methods include converting series of event names to strings, finding common patterns
    in a group of strings, discovering featured patterns when comparing two groups of strings as well
    as the number and starting position of each pattern in each string, obtaining transition matrix, 
    computing transition entropy, statistically comparing the difference between two groups of strings,
    and clustering string groups. Event names can be any action names or labels such as events in log
    files or areas of interest (AOIs) in eye tracking research.