31 citations · 96 across the 55 of their papers we have counts for
4 papers · 1 filter
An algorithm for reconstructing level-2 phylogenetic networks from trinets
Leo van Iersel, Sjors Kole, Vincent Moulton +1
Evolutionary histories for species that cross with one another or exchange genetic material can be represented by leaf-labelled, directed graphs called phylogenetic networks. A maj…
Orienting undirected phylogenetic networks
Katharina T. Huber, Leo van Iersel, Remie Janssen +4
This paper studies the relationship between undirected (unrooted) and directed (rooted) phylogenetic networks. We describe a polynomial-time algorithm for deciding whether an undir…
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…
An algorithm for computing cutpoints in finite metric spaces
A. Dress, K. T. Huber, J. Koolen +2
The theory of the tight span, a cell complex that can be associated to every metric , offers a unifying view on existing approaches for analyzing distance data, in particular fo…