Modular Leaf Ordering Methods for Dendrogram Nodes

An implementation of functions to optimize ordering of nodes in a dendrogram, without affecting the meaning of the dendrogram. A dendrogram can be sorted based on the average distance of subtrees, or based on the smallest distance value. These sorting methods improve readability and interpretability of tree structure, especially for tasks such as comparison of different distance measures or linkage types and identification of tight clusters and outliers. As a result, it also introduces more meaningful reordering for a coupled heatmap visualization. This method is described in "dendsort: modular leaf ordering methods for dendrogram representations in R", F1000Research 2014, 3: 177 .

dendsort

Modular Leaf Ordering Methods for Dendrogram Nodes

More information on this package can be found on CRAN here.

This is a forked repo from dendsort version 0.3.3, which were made given updates to CRAN dependencies. The original sourcecode by the author Ryo Sakai can be found on Bitbucket here. The only changes made to this version were related to the vignettes.

Vignettes

HTML version
Markdown version

Citation

For more information on the method, please the F1000 article here:

Sakai R, Winand R, Verbeiren T et al. 
dendsort: modular leaf ordering methods for dendrogram representations in R.
F1000Research 2014, 3:177 (https://doi.org/10.12688/f1000research.4784.1)