'QDist' implements the O(n log^2 n) time method for computing the quartet distance between unrooted evolutionary trees. It takes as input two trees in newick format over the same set of species and computes the quartet distance between them.
released on 18 July 2005
|License||Verified by||Verified on||Notes|
|GPLv2||Janet Casey||6 April 2004|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 7 January 2008.