18 citations · 79 across the 28 of their papers we have counts for
12 papers · 1 filter
Bounding the SNPR distance between two tree-child networks using generalised agreement forests
Steven Kelk, Simone Linz, Charles Semple
Agreement forests continue to play a central role in the comparison of phylogenetic trees since their introduction more than 25 years ago. More specifically, they are used to chara…
When is a set of phylogenetic trees displayed by a normal network?
Magnus Bordewich, Simone Linz, Charles Semple
A normal network is uniquely determined by the set of phylogenetic trees that it displays. Given a set of rooted binary phylogenetic trees, this paper presents a poly…
Exploring spaces of semi-directed phylogenetic networks
Simone Linz, Kristina Wicke
Semi-directed phylogenetic networks have recently emerged as a class of phylogenetic networks sitting between rooted (directed) and unrooted (undirected) phylogenetic networks as t…
Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
Katharina T. Huber, Simone Linz, Vincent Moulton
Phylogenetic networks are a special type of graph which generalize phylogenetic trees and that are used to model non-treelike evolutionary processes such as recombination and hybri…
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
Janosch Döcker, Simone Linz, Charles Semple
In the context of reconstructing phylogenetic networks from a collection of phylogenetic trees, several characterisations and subsequently algorithms have been established to recon…
Non-essential arcs in phylogenetic networks
Simone Linz, Charles Semple
In the study of rooted phylogenetic networks, analyzing the set of rooted phylogenetic trees that are embedded in such a network is a recurring task. From an algorithmic viewpoint,…
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…
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…
Display sets of normal and tree-child networks
Janosch Doecker, Simone Linz, Charles Semple
Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem of deciding if two phylogenetic networks embed the same sets of phy…
Displaying trees across two phylogenetic networks
Janosch Döcker, Simone Linz, Charles Semple
Phylogenetic networks are a generalization of phylogenetic trees to leaf-labeled directed acyclic graphs that represent ancestral relationships between species whose past includes…
On the Subnet Prune and Regraft Distance
Jonathan Klawitter, Simone Linz
Phylogenetic networks are rooted directed acyclic graphs that represent evolutionary relationships between species whose past includes reticulation events such as hybridisation and…
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set
Steven Kelk, Leo van Iersel, Nela Lekic +3
We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation…