This package includes 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.2 |
Suggests: | knitr, RColorBrewer, gplots, heatmap.plus, seriation |
Published: | 2014-09-29 |
Author: | Ryo Sakai |
Maintainer: | Ryo Sakai <ryo.sakai at esat.kuleuven.be> |
License: | GPL-2 | GPL-3 |
URL: | https://bitbucket.org/biovizleuven/dendsort/, http://f1000research.com/articles/3-177/v1 |
NeedsCompilation: | no |
CRAN checks: | dendsort results |
Reference manual: | dendsort.pdf |
Vignettes: |
Example Figures from the dendsort manuscript |
Package source: | dendsort_0.3.2.tar.gz |
Windows binaries: | r-devel: dendsort_0.3.2.zip, r-release: dendsort_0.3.2.zip, r-oldrel: dendsort_0.3.2.zip |
OS X Snow Leopard binaries: | r-release: dendsort_0.3.2.tgz, r-oldrel: dendsort_0.3.2.tgz |
OS X Mavericks binaries: | r-release: dendsort_0.3.2.tgz |
Old sources: | dendsort archive |
Reverse suggests: | gapmap |