Who is Who in Phylogenetic Networks

Publications related to 'Program TerminusEst' : TerminusEst is a Java program which takes as input two rooted (not necessarily binary) trees and outputs their hybridization network in DOT and eNewick format, or simply their hybridization number. It is available at https://skelk.sdf-eu.org/terminusest/   Order by:   Type | Year

Only And Or     related to:

Associated keywords

agreement-forest approximation explicit-network FPT from-rooted-trees phylogenetic-network phylogeny Program-CycleKiller Program-TerminusEst reconstruction

2014

1 Leo van Iersel, Steven Kelk, Nela Lekic and Celine Scornavacca. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. In BMCB, Vol. 15(127):1-12, 2014. Keywords: agreement forest, approximation, explicit network, from rooted trees, phylogenetic network, phylogeny, Program CycleKiller, Program TerminusEst, reconstruction. Note: http://dx.doi.org/10.1186/1471-2105-15-127.

2013

2 Teresa Piovesan and Steven Kelk. A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees. In TCBB, Vol. 10(1):18-25, 2013. Keywords: FPT, from rooted trees, phylogenetic network, phylogeny, Program TerminusEst, reconstruction. Note: http://arxiv.org/abs/1207.6090.         Toggle abstract "Here, we present a new fixed parameter tractable algorithm to compute the hybridization number (r) of two rooted, not necessarily binary phylogenetic trees on taxon set (X) in time ((6r r) · poly(n)), where (n= |X|). The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on (X), and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem. © 2004-2012 IEEE."