TREECUT: algorithm for extracting significant modules from hierarchical clustering

Treecut is an algorithm for identifying non-overlapping modular structures from hierarchical clustering.

Try this demo

Please upload your tree file in Newick format:

Please upload your list file that contains values for terminal nodes:

treat values as continuous; use t-test for significance testing

Software availability

Current version hosted on github repository
$ git clone
Disclaimer: this software is free to use, modify, redistribute without any restrictions.
Documentation: please read the documentation on github


The algorithm has been tested in several applications including:

Results and procedures can be accessed here.


This software is represents a work in progress. Please interpret the results with cautions.


All bug reports, suggestions or questions are very welcome and should be dumped to
Haibao Tang : bao at uga dot edu

Valid XHTML 1.0 Transitional Python

Last update: May 01, 2009 Haibao Tang