Implementations of most of the existing proximity-based methods of 
  link prediction in graphs. Among the 20 implemented methods are e.g.:
  Adamic L. and Adar E. (2003) <doi:10.1016/S0378-8733(03)00009-1>,
  Leicht E., Holme P., Newman M. (2006) <doi:10.1103/PhysRevE.73.026120>,
  Zhou T. and Zhang Y (2009) <doi:10.1140/epjb/e2009-00335-8>, and
  Fouss F., Pirotte A., Renders J., and Saerens M. (2007) <doi:10.1109/TKDE.2007.46>.

Compute and visualize using the 'visNetwork' package all the bivariate correlations of a dataframe.
  Several and different types of correlation coefficients (Pearson's r, Spearman's rho, Kendall's tau,
  distance correlation, maximal information coefficient and 
  equal-freq discretization-based maximal normalized mutual information) are used according to 
  the variable couple type (quantitative vs categorical, quantitative vs quantitative, categorical vs categorical).

Estimates group transmission assortativity coefficients from transmission trees. 
    Group transmission assortativity coefficients measure the tendency for individuals to transmit 
    within their own group (e.g. age group, vaccination status, or location) compared to other groups. 
    The package requires information on who infected whom, group membership for all individuals, 
    and the relative sizes of each group in the population. 
    For more details see Geismar et al. (2024) <doi:10.1371/journal.pone.0313037>.

A 'LaTeX' Letter class for 'rmarkdown', using the
 'pandoc-letter' template adapted for use with 'markdown'.

Conveniently generate 'CSS' using R code.

Generate concentration-time profiles from linear pharmacokinetic
  (PK) systems, possibly with first-order absorption or zero-order infusion,
  possibly with one or more peripheral compartments, and possibly under
  steady-state conditions. Single or multiple doses may be specified. Secondary
  (derived) PK parameters (e.g. Cmax, Ctrough, AUC, Tmax, half-life, etc.) are
  computed.

Can be used to solve Linear Programming / Linear
   Optimization problems by using the simplex algorithm.