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 .


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("dendsort")

0.3.4 by Evan Biederstedt, 5 months ago


https://github.com/evanbiederstedt/dendsort


Report a bug at https://github.com/evanbiederstedt/dendsort/issues


Browse source code at https://github.com/cran/dendsort


Authors: Ryo Sakai [aut] , Evan Biederstedt [cre, aut]


Documentation:   PDF Manual  


GPL-2 | GPL-3 license


Suggests knitr, RColorBrewer, gplots, seriation, gapmap, rmarkdown


Imported by pagoda2.

Suggested by gapmap.


See at CRAN