Computes the quartet distance between unrooted evolutionary trees
'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 23 January 2017.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.