Who is Who in Phylogenetic Networks

Publications related to 'Program Clustistic' : CLUSTISTIC is a Java program which, given a set T of rooted binary trees on the same set of taxa, constructs (all) networks with a minimum number of reticulations that represent the set of clusters induced by the trees in T (in the softwired sense). Available at http://skelk.sdf-eu.org/clustistic/   Order by:   Type | Year

Only And Or     related to:

Associated keywords

explicit-network FPT from-clusters from-rooted-trees from-triplets kernelization level-k-phylogenetic-network minimum-number phylogenetic-network phylogeny Program-Clustistic Program-MaafB Program-PIRN reconstruction software

Article (Journal)

1 Steven Kelk, Celine Scornavacca and Leo van Iersel. On the elusiveness of clusters. In TCBB, Vol. 9(2):517-534, 2012. Keywords: explicit network, from clusters, from rooted trees, from triplets, level k phylogenetic network, phylogenetic network, phylogeny, Program Clustistic, reconstruction, software. Note: http://arxiv.org/abs/1103.1834.         2 Leo van Iersel and Simone Linz. A quadratic kernel for computing the hybridization number of multiple trees. In IPL, Vol. 113:318-323, 2013. Keywords: explicit network, FPT, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Clustistic, Program MaafB, Program PIRN, reconstruction. Note: http://arxiv.org/abs/1203.4067, poster.         Toggle abstract "It has recently been shown that the NP-hard problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter tractable if an instance of the problem consists of precisely two such trees. In this paper, we show that this problem remains fixed-parameter tractable for an arbitrarily large set of rooted binary phylogenetic trees. In particular, we present a quadratic kernel. © 2013 Elsevier B.V."