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.


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.3 by Ryo Sakai, 3 years ago


https://bitbucket.org/vda-lab/dendsort/, http://f1000research.com/articles/3-177/v1


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


Authors: Ryo Sakai


Documentation:   PDF Manual  


GPL-2 | GPL-3 license


Suggests knitr, RColorBrewer, gplots, heatmap.plus, seriation, gapmap


Suggested by gapmap.


See at CRAN