18 citations · 79 across the 28 of their papers we have counts for
9 papers · 1 filter
Order-Dependent Dissimilarity Measures on Phylogenetic Trees
Simone Linz, Katherine St. John, Charles Semple +1
Ordered leaf attachment, Phylo2Vec, and HOP are three recently introduced vector representations for rooted phylogenetic trees where the representation is determined by an ordering…
Phylogenetic trees defined by at most three characters
Katharina T. Huber, Simone Linz, Vincent Moulton +1
In evolutionary biology, phylogenetic trees are commonly inferred from a set of characters (partitions) of a collection of biological entities (e.g., species or individuals in a po…
On the existence of a cherry-picking sequence
Janosch Döcker, Simone Linz
Recently, the minimum number of reticulation events that is required to simultaneously embed a collection P of rooted binary phylogenetic trees into a so-called temporal network ha…
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
Simone Linz, Charles Semple
Throughout the last decade, we have seen much progress towards characterising and computing the minimum hybridisation number for a set P of rooted phylogenetic trees. Roughly speak…
Deciding the existence of a cherry-picking sequence is hard on two trees
Janosch Döcker, Leo van Iersel, Steven Kelk +1
Here we show that deciding whether two rooted binary phylogenetic trees on the same set of taxa permit a cherry-picking sequence, a special type of elimination order on the taxa, i…
Fighting network space: it is time for an SQL-type language to filter phylogenetic networks
Steven Kelk, Simone Linz, David A. Morrison
The search space of rooted phylogenetic trees is vast and a major research focus of recent decades has been the development of algorithms to effectively navigate this space. Howeve…
Identifying a species tree subject to random lateral gene transfer
Mike Steel, Simone Linz, Daniel H. Huson +1
A major problem for inferring species trees from gene trees is that evolutionary processes can sometimes favour gene tree topologies that conflict with an underlying species tree.…
A quadratic kernel for computing the hybridization number of multiple trees
Leo van Iersel, Simone Linz
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…
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility
Maria Luisa Bonet, Simone Linz, Katherine St. John
We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide…