Download List

專案描述

The QDist package implements the O(n log^2 n) time
method for computing the quartet distance between
unrooted evolutionary trees.

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2004-04-06 13:23 Back to release list
1.3.0

An alternative algorithm has been added to the tool. This new algorithm is significantly simpler than the old one, and while it does not guarantee a O(nlog^2n) runtime performance (but a O(n^2)) it works significantly faster in practice on smaller trees.
標籤: Major feature enhancements

Project Resources