Provides the design of multi-group phase
    II clinical trials with binary outcomes using the hierarchical Bayesian
    classification and information sharing (BaCIS) model. Subgroups are classified
    into two clusters on the basis of their outcomes mimicking the hypothesis
    testing framework. Subsequently, information sharing takes place within
    subgroups in the same cluster, rather than across all subgroups. This method can
    be applied to the design and analysis of multi-group clinical trials with binary
    outcomes. Reference: Nan Chen and J. Jack Lee (2019) <doi:10.1002/bimj.201700275>.

An implementation of methods for extracting an unweighted unipartite
   graph (i.e. a backbone) from an unweighted unipartite graph, a weighted unipartite
   graph, the projection of an unweighted bipartite graph, or the projection
   of a weighted bipartite graph (Neal, 2022 <doi:10.1371/journal.pone.0269137>).

Provides a backward-pipe operator for 'magrittr' (%<%) or 
    'pipeR' (%<<%) that allows for a performing operations from right-to-left. 
    This allows writing more legible code where right-to-left ordering is 
    natural. This is common with hierarchies and nested structures such as 
    trees, directories or markup languages (e.g. HTML and XML). 
    The package also includes a R-Studio add-in that can be bound to a keyboard 
    shortcut.

Functions introduced or changed since R v3.0.0 are re-implemented in this
    package. The backports are conditionally exported in order to let R resolve
    the function name to either the implemented backport, or the respective base
    version, if available. Package developers can make use of new functions or
    arguments by selectively importing specific backports to
    support older installations.

Code for 'backShift', an algorithm to estimate the connectivity
    matrix of a directed (possibly cyclic) graph with hidden variables. The
    underlying system is required to be linear and we assume that observations
    under different shift interventions are available. For more details,
    see <arXiv:1506.02494>.