57 citations · 110 across the 40 of their papers we have counts for
4 papers · 1 filter
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
Katharina Huber, Leo van Iersel, Vincent Moulton +2
Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network…
Exact reconciliation of undated trees
Leo van Iersel, Celine Scornavacca, Steven Kelk
Reconciliation methods aim at recovering macro evolutionary events and at localizing them in the species history, by observing discrepancies between gene family trees and species t…
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
Leo van Iersel, Steven Kelk, Nela Lekic +1
A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V a…
Hybridization Number on Three Rooted Binary Trees is EPT
Leo van Iersel, Steven Kelk, Nela Lekić +2
Phylogenetic networks are leaf-labelled directed acyclic graphs that are used to describe non-treelike evolutionary histories and are thus a generalization of phylogenetic trees. T…