Related Experiment Video
Updated: Jul 26, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Fast optimal leaf ordering for hierarchical clustering
Z Bar-Joseph1, D K Gifford, T S Jaakkola
1Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MA 02139, USA.
Abstract:
We present the first practical algorithm for the optimal linear leaf ordering of trees that are generated by hierarchical clustering. Hierarchical clustering has been extensively used to analyze gene expression data, and we show how optimal leaf ordering can reveal biological structure that is not observed with an existing heuristic ordering method. For a tree with n leaves, there are 2(n-1) linear orderings consistent with the structure of the tree. Our optimal leaf ordering algorithm runs in time O(n(4)), and we present further improvements that make the running time of our algorithm practical.
More Related Videos
05:12ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
Published on: January 16, 2019
06:01Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore
Published on: December 12, 2019
Related Concept Videos
Optimal Foraging
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Quantifying and Rejecting Outliers: The Grubbs Test
Friedman Two-way Analysis of Variance by Ranks
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Methods of Medium Optimization