Publications related to 'Program Treeduce' : Treeduce is a Java program which takes as input a set of rooted trees, non necessarily binary, and which outputs a reduced version of these trees. These reduced trees will have the same hybridization number (a measure of the complexity of the optimal network which contains all those trees) than the original ones. Available at https://leovaniersel.wordpress.com/software/treeduce/.
|
Order by: Type | Year
|
|
|
|
|
|
|
Leo van Iersel,
Steven Kelk and
Celine Scornavacca. Kernelizations for the hybridization number problem on multiple nonbinary trees. In JCSS, Vol. 82(6):1075-1089, 2016. Keywords: explicit network, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Treeduce, reconstruction. Note: https://arxiv.org/abs/1311.4045v3.
|
|
|
|
|
|
Leo van Iersel and
Steven Kelk. Kernelizations for the hybridization number problem on multiple nonbinary trees. In WG14, Vol. 8747:299-311 of LNCS, springer, 2014. Keywords: explicit network, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Treeduce, reconstruction. Note: http://arxiv.org/abs/1311.4045.
|
|
|
|