Optimal Leaf Ordering

Dinesh Manandhar

This program orders the given equinumerous sequences of numbers on the basis of their similarities. It optimizes the clustering order generated by Hierarchical UPGMA clustering. To learn more about what this program does, click here.

Enter the number sequences - the sequences have to be equinumerous and of this format.

Please check which distance formula to use:

Manhattan Distance Euclidean Distance Dot Product Distance

This program is based on a paper entitled "Fast Optimal Leaf Ordering for Heirarchical Clustering" by Ziv B. J. et. al.Special thanks to Dr. Ivaylo Ilinkin for his support.