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. This method is described in "dendsort: modular leaf ordering methods for dendrogram representations in R", F1000Research 2014, 3: 177 <doi:10.12688/f1000research.4784.1>.

Version: 0.3.4
Suggests: knitr, RColorBrewer, gplots, seriation, gapmap, rmarkdown
Published: 2021-04-20
DOI: 10.32614/CRAN.package.dendsort
Author: Ryo Sakai [aut], Evan Biederstedt [cre, aut]
Maintainer: Evan Biederstedt <evan.biederstedt at>
License: GPL-2 | GPL-3
NeedsCompilation: no
Materials: README
CRAN checks: dendsort results


Reference manual: dendsort.pdf
Vignettes: "Figures from Manuscript"


Package source: dendsort_0.3.4.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): dendsort_0.3.4.tgz, r-oldrel (arm64): dendsort_0.3.4.tgz, r-release (x86_64): dendsort_0.3.4.tgz, r-oldrel (x86_64): dendsort_0.3.4.tgz
Old sources: dendsort archive

Reverse dependencies:

Reverse imports: pagoda2
Reverse suggests: BloodCancerMultiOmics2017, ComplexHeatmap, gapmap


Please use the canonical form to link to this page.