Difference between revisions of "QDist"
(Created page with "{{Entry |Name=QDist |Short description=Computes the quartet distance between unrooted evolutionary trees |Full description='QDist' implements the O(n log^2 n) time method for com...") |
(No version changes) |
||
| Line 3: | Line 3: | ||
|Short description=Computes the quartet distance between unrooted evolutionary trees | |Short description=Computes the quartet distance between unrooted evolutionary trees | ||
|Full description='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. | |Full description='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. | ||
| + | |Homepage URL=http://www.daimi.au.dk/~mailund/qdist.html | ||
|User level=none | |User level=none | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C++ | |Computer languages=C++ | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Related projects=Open_BEAGLE | |Related projects=Open_BEAGLE | ||
|Keywords=bioinformatics,O,(n log^2 n),time method,quartet distance,unrooted,evolutionary tree,newick | |Keywords=bioinformatics,O,(n log^2 n),time method,quartet distance,unrooted,evolutionary tree,newick | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Version identifier=2.0.1 | |Version identifier=2.0.1 | ||
|Version date=2005-07-18 | |Version date=2005-07-18 | ||
|Version status=stable | |Version status=stable | ||
|Version download=http://www.daimi.au.dk/~mailund/qdist/qdist-2.0.1.tar.gz | |Version download=http://www.daimi.au.dk/~mailund/qdist/qdist-2.0.1.tar.gz | ||
| + | |Version comment=2.0.1 stable released 2005-07-18 | ||
| + | |Last review by=Alejandroindependiente | ||
| + | |Last review date=2017/01/23 | ||
| + | |Submitted by=Database conversion | ||
| + | |Submitted date=2011-04-01 | ||
| + | |Status= | ||
| + | |Is GNU=No | ||
| + | |License verified date=2004-04-06 | ||
| + | }} | ||
| + | {{Project license | ||
| + | |License=GPLv2 | ||
| + | |License verified by=Janet Casey | ||
|License verified date=2004-04-06 | |License verified date=2004-04-06 | ||
| − | |||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Thomas Mailund | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=thomas@mailund.dk | |Email=thomas@mailund.dk | ||
|Resource URL= | |Resource URL= | ||
| Line 44: | Line 42: | ||
|Use=science | |Use=science | ||
}} | }} | ||
| − | {{ | + | {{Featured}} |
| − | |||
| − | |||
| − | |||
| − | }} | ||
Latest revision as of 17:14, 23 January 2017
QDist
http://www.daimi.au.dk/~mailund/qdist.html
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.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Thomas Mailund | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Support | mailto:mailund@birc.dk |
Software prerequisites
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.