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-03-18 22:47
1.1.0

This release reduces the runtime to about 25% of the previous release. The evaluation order of the counting polynomials in the hierarchical tree has been changed with fewer polynomical manipulations as a consequence. This change significantly improves the running time.
標籤: Major feature enhancements

2003-11-05 20:31
1.0.6

The parser was updated so that it can parse trees annotated with bootstrap values. It will ignore the actual values, but it will accept the trees.
標籤: Minor feature enhancements

2003-10-20 09:47
1.0.5

The tool can now read not-completely-binary
trees by replacing nodes with degree 2 with
edges.
標籤: Minor bugfixes

2003-10-06 09:38
1.0.4

The lexer was changed to accept a wider range of
leaf names.
標籤: Minor feature enhancements

2003-08-07 23:50
1.0.3

This release improves the consistency check before calculating the quartet distance of the input trees. It catches obvious mistakes, such as more than one leaf with the same name or different sets of labels on the two input trees, before it initiates the expensive calculations.
標籤: Minor feature enhancements

Project Resources