QDist 2.0.2 – Computation of Quartet Distance between Evolutationary Trees

QDist 2.0.2

:: DESCRIPTION

QDist implements a sub-cubic algorithm for computing the quartet distance between general trees (i.e. the trees are not required to be binary).

Advertisement

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

::DEVELOPER

Thomas Mailund , Jesper Nielsen

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

 QDist

:: MORE INFORMATION

Citation:

T. Mailund and C.N.S. Pedersen,
QDist—Quartet Distance Between Evolutionary Trees,
Bioinformatics, Vol. 20, No. 10, pp 1636-1637, 2004.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.