Fast optimal leaf ordering for hierarchical clustering

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 2n-1 linear orderings consistent with the structure of the tree. Our optimal leaf ordering algorithm runs in time O (n4), and we present further improvements that make the running time of our algorithm practical. © Oxford University Press 2001.