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.
|Date of publication||2015-12-14 12:39:17|
|Maintainer||Ryo Sakai <firstname.lastname@example.org>|
|License||GPL-2 | GPL-3|
cal_length: Recursive function to calculate the length of branches
cal_node_limit: Calculate the x coordinates given a branch of dendrogram
cal_total_length: Calculate the total length of lines to draw the dendrogram
dendsort: Sorting and reordering dendrogram nodes
dendsort-package: Modular Leaf Ordering Methods for Dendrogram Nodes
sample_tcga: Sample data matrix from the integrated pathway analysis of...
sort_average: Sorting and reordering dendrogram nodes by average distances
sort_average_r: Sorting and reordering dendrogram nodes by average distances...
sort_smallest: Sorting and reordering dendrogram nodes by the smallest value
sort_smallest_r: Sorting and reordering dendrogram nodes by the smallest value...