TripleC (Triple Consensus) is a program to construct consensus trees from rooted triples.

Usage
java -jar Triplec.jar NoReps InFile.newick

Here NoReps is the number of triple reconstructions to use for the consensus. This is required because reconstruction is a randomized algorithm. For small trees of about 20 taxa 1000 replicates is enough. But larger numbers should be used for bigger data sets.
InFile.newick is a text file with one newick tree per line. The trees are considered to be rooted and each tree must contain only the taxa labels of the first tree. That is trees after the first must not contain new taxa.
Although it is not a error to have trees with less taxa than the first tree as part of the consensus, this method is not a super-tree method. Performance under these conditions has not been tested and we expect would perform poorly.

Requirements:
* Java

The license of this software is Free, you can free download and free use this calculator software.