57 citations · 110 across the 40 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
q-bio.PE2009
A short note on the tractability of constructing phylogenetic networks from clusters
Leo van Iersel, Steven Kelk
In [2] it was proven that the Cass algorithm is a polynomial-time algorithm for constructing level<=2 networks from clusters. Here we demonstrate, for each k>=0, a polynomial-time…
cs.DM2009
Computing Rooted and Unrooted Maximum Consistent Supertrees
Leo van Iersel, Matthias Mnich
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted b…