CRAN/E | dendsort

dendsort

Modular Leaf Ordering Methods for Dendrogram Nodes

Installation

About

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.

github.com/evanbiederstedt/dendsort
Bug report File report

Key Metrics

Version 0.3.4
Published 2021-04-20 1074 days ago
Needs compilation? no
License GPL-2
License GPL-3
CRAN checks dendsort results

Downloads

Yesterday 54 0%
Last 7 days 188 -22%
Last 30 days 980 -8%
Last 90 days 6.312 +90%
Last 365 days 15.973 +33%

Maintainer

Maintainer

Evan Biederstedt

evan.biederstedt@gmail.com

Authors

Ryo Sakai

aut

Evan Biederstedt

cre / aut

Material

README
Reference manual
Package source

Vignettes

"Figures from Manuscript"

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

dendsort archive

Suggests

knitr
RColorBrewer
gplots
seriation
gapmap
rmarkdown

Reverse Imports

pagoda2

Reverse Suggests

BloodCancerMultiOmics2017
ComplexHeatmap
gapmap