38 citations · 173 across the 47 of their papers we have counts for
5 papers · 1 filter
Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks
Yukihiro Murakami, Leo van Iersel, Remie Janssen +2
Network reconstruction lies at the heart of phylogenetic research. Two well studied classes of phylogenetic networks include tree-child networks and level- networks. In a tree-c…
Treewidth of display graphs: bounds, brambles and applications
Remie Janssen, Mark Jones, Steven Kelk +2
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or…
A third strike against perfect phylogeny
Leo van Iersel, Mark Jones, Steven Kelk
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situation when each evolutionary trait emerges only once in history; if such events…
Not all phylogenetic networks are leaf-reconstructible
Péter L. Erdős, Leo van Iersel, Mark Jones
Unrooted phylogenetic networks are graphs used to represent evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It h…
Polynomial-Time Algorithms for Phylogenetic Inference Problems involving duplication and reticulation
Leo van Iersel, Remie Janssen, Mark Jones +2
A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Min…