Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bar-Joseph, Z.
Right arrow Articles by Jaakkola, T. S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bar-Joseph, Z.
Right arrow Articles by Jaakkola, T. S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 90001 2001
Pages S22-S29
© 2001 Oxford University Press

Fast optimal leaf ordering for hierarchical clustering

Ziv Bar-Joseph 1, David K. Gifford 1,2 and Tommi S. Jaakkola 2

1 Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MA, 02139, USA
2 Artificial Intelligence Laboratory, MIT, 545 Technology Square, Cambridge, MA, 02139, USA

Received on February 5, 2001 ; revised on March 26, 2001 ; accepted on March 26, 2001

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.

Contact: {zivbj,gifford}@mit.edu; tommi{at}ai.mit.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.