A preprocessing algorithm for Hybridization Number on any number of binary or nonbinary trees.
Reference
Leo van Iersel, Steven Kelk and Celine Scornavacca, Kernelizations for the hybridization number problem on multiple nonbinary trees. Journal of Computer and System Sciences, 82(6): 1075–1089 (2016). (arXiv) Preliminary version in WG 2014. LNCS 8747, 299-311 (2014).
Installation
Download the source file Treeduce.java.
Download and install a Java Compiler.
Open a terminal window and navigate to the folder of Treeduce.
Type “javac Treeduce.java” to compile the program.
Running the program
Type “java Treeduce input.tree [k] [-s]”
| input.tree | text file containing any number of trees in Newick format |
| k | the value of the parameter (default is 1) |
| -s | use this to enable silent mode |
The reduced trees will be saved in Newick format to a file called “reduced.tree”.
Example
An example input file: example.txt
Advertisements
