Quickquartet¶

Description¶

QuickQuartet algorithm helps compute the all-to-all quartet distance for large evolutionary tree collections. By leveraging the relationship between bipartitions and quartets this 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.

Environment Modules¶

Run module spider quickquartet to find out what environment modules are available for this application.

Environment Variables¶

HPC_QUICKQUARTET_DIR - installation directory
HPC_QUICKQUARTET_BIN - executable directory

Categories¶

biology, ngs