dendsort: 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.

Version: 0.3.3
Suggests: knitr, RColorBrewer, gplots,, seriation, gapmap
Published: 2015-12-14
Author: Ryo Sakai
Maintainer: Ryo Sakai <ryo at>
License: GPL-2 | GPL-3
NeedsCompilation: no
CRAN checks: dendsort results


Reference manual: dendsort.pdf
Vignettes: Example Figures from the dendsort manuscript
Package source: dendsort_0.3.3.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: dendsort_0.3.3.tgz
OS X Mavericks binaries: r-oldrel: dendsort_0.3.3.tgz
Old sources: dendsort archive

Reverse dependencies:

Reverse suggests: gapmap


Please use the canonical form to link to this page.