| Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. In this paper, we study how to present gene expression data to display similarities by trying to find a linear ordering of genes such that genes with similar expression profiles will be close in this ordering. In general, finding the best possible order is intractable, and furthermore an unrestricted ordering may not be desired. Therefore we concentrate on the case in which hierarchical clustering has been applied to the gene expression profiles, and show that the best order respecting the clustering can be computed efficiently, better than known algorithms by a factor of n. We perform experiments comparing the optimal order to several other methods, including unrestricted orderings. The implementation of the algorithm, as well as a simple program for viewing hierarchically clustered expression array data and the complete results of our experiments, are available at | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||