Difference between revisions of "Quickquartet"
Jump to navigation
Jump to search
Moskalenko (talk | contribs) m (Text replacement - "#uppercase" to "uc") |
|||
| Line 33: | Line 33: | ||
--> | --> | ||
==System Variables== | ==System Variables== | ||
| − | * HPC_{{ | + | * HPC_{{uc:{{#var:app}}}}_DIR |
<!--Configuration--> | <!--Configuration--> | ||
{{#if: {{#var: conf}}|==Configuration== | {{#if: {{#var: conf}}|==Configuration== | ||
Revision as of 21:24, 6 December 2019
Description
This project contains the QuickQuartet algorithm for computing the all-to-all quartet distance for large evolutionary tree collections. By leveraging the relationship between bipartitions and quartets, our approach significantly improves upon the performance of existing quartet distance algorithms. Experimental results show that QuickQuartet is up to 100 times faster than existing methods. With the availability of QuickQuartet, the use of quartet distance as a tool for analysis of evolutionary relationships becomes a practical tool for biologists to use in order to gain new insights regarding their large tree collections.
Required Modules
Serial
- quickquartet
System Variables
- HPC_QUICKQUARTET_DIR
Validation
- Validated 4/5/2018