18 citations · 79 across the 28 of their papers we have counts for
4 papers · 1 filter
Reflections on kernelizing and computing unrooted agreement forests
Rim van Wersch, Steven Kelk, Simone Linz +1
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. Here we explore the practical impact of kernelization (i.e. data reduction) on the NP-hard proble…
On the maximum agreement subtree conjecture for balanced trees
Magnus Bordewich, Simone Linz, Megan Owen +3
We give a counterexample to the conjecture of Martin and Thatte that two balanced rooted binary leaf-labelled trees on leaves have a maximum agreement subtree (MAST) of size at…
Weakly displaying trees in temporal tree-child network
Katharina T. Huber, Simone Linz, Vincent Moulton
Recently there has been considerable interest in the problem of finding a phylogenetic network with a minimum number of reticulation vertices which displays a given set of phylogen…
Caterpillars on three and four leaves are sufficient to reconstruct normal networks
Simone Linz, Charles Semple
While every rooted binary phylogenetic tree is determined by its set of displayed rooted triples, such a result does not hold for an arbitrary rooted binary phylogenetic network. I…