Fast Optimal Leaf Ordering For Hierarchical Clustering (2001)
| Citations: | 34 - 4 self |
BibTeX
@MISC{Bar-joseph01fastoptimal,
author = {Ziv Bar-joseph and David K. Gifford and Tommi S. Jaakkola},
title = {Fast Optimal Leaf Ordering For Hierarchical Clustering},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 linear orderings consistent with the structure of the tree. Our optimal leaf ordering algorithm runs in time O(n ), and we present further improvements that make the running time of our algorithm practical.
Citations
| 1176 | Cluster analysis and display of genome-wide expression patterns - Eisen, Spellman, et al. - 1998 |
| 54 | Fast hierarchical clustering and other applications of dynamic closest pairs - Eppstein - 1998 |
| 10 | et al. (2000) Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling - Alizadeh |
| 5 | KANIN et al., 2001 Remodeling of yeast genome expression in response to environmental changes - CAUSTON, REN, et al. |
