v1.7.4

• Tiny update PI -> M_PI requested by Dirk to prevent removal from CRAN.

v1.7.3

• Package is now on CRAN again after check-as-cran complaints.

v1.7.1

• Package rebrand to DGM
• Full integration of greedy search network discovery (flexible model store size)
• The network pruning is optional now and not run by default. The reason is that with the greedy search we might no have the full model space available for post-hoc optimizations.
• Small Fixes

v1.6

• Stepwise non-exhaustive greedy search (contributed by Ruth Harbord, Warwck Uni)
• Minor improvements for plotting and visualization
• Minor bugfixes
• Improved documentation, Readme, and Developer guide

v1.5.1

• Fix for CRAN r-devel requirements
• Available on official CRAN repository now

v1.5

• New package name "multdyn" (mdm is already taken in official CRAN)
• Upgrade to ggplot2 for plot function, new function gplotMat().
• Speed up reading and loading subjects for large networks in read.subject()

v1.4

• Patel's Tau/Kappa connectivity method with permutation test
• Bugfix
• Documentation updates

v1.3

• User can set priors now
• Reliability measures to calculate sensitivity, specificity, accuracy, and more
• Thresholding edges to force unidirectional edge in case likelihood of bidirectional and unidirectional model are close

v1.2

• new function node() which is usefull massive HPC analyses on the node level
• improved adjacency plots with nice colormaps
• analysis outputs as txt files

v1.1.2

• New functions for data analysis and visualisation