QuickJoin implements a heuristic for speeding up neighbour joining, making neighbour joining feasible for large sets of taxa.
Version: 1.0.10QuickJoin project implements a heuristic for speeding up neighbour joining, making neighbour joining feasible for large sets of taxa. The inferred tree is identical to the tree inferred by the traditional neighbour joining method, but the heuristic will (potentially) construct the tree significantly faster.
Operating System: Linux
The QuickJoin program, qjoin reads a distance matrix in phylip format from an input file or stdin, and output the inferred tree, in newick format, to a file or stdout. Run 'qjoin --help' for more info.
The QuickJoin package is written in C++. It should compile on any Unix like system. To install the package, download the source code and unpack it (tar xzf quick-join-a.b.c.tar.gz, where a.b.c is the version number of quick-join), then run configure and make in the subdirectory quick-join-a.b.c created during unpacking. This creates the QuickJoin program, qjoin together with a number of test programs. To check that everything went right, run make check. If all tests pass, install the qjoin program by running make install. Read the INSTALL file for more info.
Currently, the only binary distribution is in RPM packages. Other formats might appear, if I am asked to build them (and told how to...). To install, download the file and run rpm -U quick-join-version.arch.rpm.
What's New in This Release:
· This version splits the output, when doing bootstrapping, into two trees, one annotated with branch lengths and one annotated with bootstrap values.
· This makes post-processing easier, since most tools support a single branch annotation but not two.