dendsort: Modular Leaf Ordering Methods for Dendrogram Nodes
Version 0.3.3

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.

Package details

AuthorRyo Sakai
Date of publication2015-12-14 12:39:17
MaintainerRyo Sakai <[email protected]>
LicenseGPL-2 | GPL-3
Version0.3.3
URL https://bitbucket.org/vda-lab/dendsort/ http://f1000research.com/articles/3-177/v1
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("dendsort")

Try the dendsort package in your browser

Any scripts or data that you put into this service are public.

dendsort documentation built on May 30, 2017, 1:42 a.m.